Enhancing global search ability of quantum-behaved particle swarm optimization by maintaining diversity of the swarm

Abstract

Premature convergence, the major problem that confronts evolutionary algorithms, is also encountered with the Particle Swarm Optimization (PSO) algorithm. Quantum-behaved Particle Swarm (QPSO), a novel variant of PSO, is a global-convergence-guaranteed algorithm and has a better search ability than the original PSO. But like PSO and other evolutionary optimization techniques, premature in QPSO is also inevitable. The reason for premature convergence in PSO or QPSO is that the information flow between particles makes the diversity of the population decline rapidly. In this paper, we propose Diversity-Maintained QPSO (DMQPSO). Before describing the new method, we first introduce the origin and development of PSO and QPSO. DMQPSO, along with the PSO and QPSO, is tested on several benchmark functions for performance comparison. The experiment results show that the DMQPSO outperforms the PSO and QPSO in many cases. © Springer-Verlag Berlin Heidelberg 2006.