Diversity-Guided Quantum-Behaved Particle Swarm Optimization Algorithm based on Clustering Coefficient and Characteristic Distance
Aiming at the drawback of being easily trapped into the local optima and premature convergence in quantum behaved particle swarm optimization algorithm, clustering coefficient and characteristic distance is proposed to measure diversity of the population by which quantum behaved particle swarm optimization algorithm is guided. The population is divergent to increase population diversity and enhance exploration if clustering coefficient is large and characteristic distance is small; the population is convergent to reduce population diversity and enhance exploitation if clustering coefficient is small and characteristic distance is large. The simulation results of testing four benchmark functions show that diversity-guided quantum behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance has better optimization performance than other algorithms, the validity and feasibility of the method is verified.
Wei Zhao Ye San
authors are with the Control and Simulation Center,Harbin Institute of Technology,No.92,West Da-Zhi This work was supported by the National Natural Science Foundation of China under grant 60474069.
国际会议
哈尔滨
英文
1001-1006
2010-01-08（万方平台首次上网日期，不代表论文的发表时间）