A Novel Quantum-Behaved Particle Swarm Optimization Algorithm

Abstract

A novel Quantum-behaved Particle Swarm Optimization algorithm with probability (P-QPSO) is introduced to improve the global convergence property of QPSO. In the proposed algorithm, all the particles keep the original evolution with large probability, and do not update the position of particles with small probability, and re-initialize the position of particles with small probability. Seven benchmark functions are used to test the performance of P-QPSO. The results of experiment show that the proposed technique can increase diversity of population and converge more rapidly than other evolutionary computation methods.