中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共3条，第1-3条

帮助

条数/页：排序方式：
	Chaotic particle swarm optimization with sigmoid-based acceleration coefficients for numerical function optimization 期刊论文 OAI收割 SWARM AND EVOLUTIONARY COMPUTATION, 2019, 卷号: 51, 页码: 16 作者: Tian, Dongping; Zhao, Xiaofei; Shi, Zhongzhi \| 收藏 \| 浏览/下载：26/0 \| 提交时间：2020/12/10 Particle swarm optimization Acceleration coefficients Logistic map Swarm diversity Inertial weight Premature convergence
	DMPSO: Diversity-Guided Multi-Mutation Particle Swarm Optimizer 期刊论文 OAI收割 IEEE ACCESS, 2019, 卷号: 7, 页码: 124008-124025 作者: Tian, Dongping; Zhao, Xiaofei; Shi, Zhongzhi \| 收藏 \| 浏览/下载：53/0 \| 提交时间：2019/12/10 Particle swarm optimization opposition-based learning swarm diversity inertial weight premature convergence local optima mutation strategy
	An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE) 会议论文 OAI收割 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 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：25/0 \| 提交时间：2013/03/25 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.