中国科学院机构知识库网格系统: An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)

中国科学院机构知识库网格

Chinese Academy of Sciences Institutional Repositories Grid

An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)

文献类型：会议论文


作者	Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y.
出版日期	2007
会议名称	2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007
会议地点	Silicon Valley, CA, United states
关键词	An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.
页码	35-38
收录类别	EI
源URL	[http://ir.ciomp.ac.cn/handle/181722/33300]
专题	长春光学精密机械与物理研究所_中科院长春光机所知识产出_会议论文
推荐引用方式 GB/T 7714	Wang Y.,Wang Y.,Wang Y.,et al. An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)[C]. 见:2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007. Silicon Valley, CA, United states.

入库方式： OAI收割

来源：长春光学精密机械与物理研究所

浏览0

下载0

收藏0

其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。