By Topic

Diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei Zhao ; Control & Simulation Center, Harbin Inst. of Technol., Harbin, China ; Ye San

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.

Published in:

Systems and Control in Aeronautics and Astronautics (ISSCAA), 2010 3rd International Symposium on

Date of Conference:

8-10 June 2010