A Novel Binary Quantum-Behaved Particle Swarm Optimization Algorithm

To keep the balance between the global search and local search, a novel binary quantum-behaved particle swarm optimization algorithm with comprehensive learning and cooperative approach (CCBQPSO) is presented. In the proposed algorithm, all the particles' personal best position can participate in updating the local attractor firstly. Then all the particles' previous personal best position and swarm's global best position are performed in each dimension of the solution vector. Five test functions are used to test the performance of CCBQPSO. The results of experiment show that the proposed technique can increase diversity of swarm and converge more rapidly than other binary algorithms.

[1]  Xiaojun Wu,et al.  Convergence analysis and improvements of quantum-behaved particle swarm optimization , 2012, Inf. Sci..

[2]  Xiaojun Wu,et al.  A Review of Quantum-behaved Particle Swarm Optimization , 2010 .

[3]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[4]  Xiaojun Wu,et al.  Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection , 2012, Evolutionary Computation.

[5]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[6]  Wu Yong.  Quantum-behaved particle swarm optimization with binary encoding , 2010 .

[7]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Wenbo Xu,et al.  Particle swarm optimization with particles having quantum behavior , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).