A novel and more efficient search strategy of quantum-behaved particle swarm optimization

Abstract

Based on the previous proposed Quantum-behaved Particle Swarm Optimization (QPSO), in this paper, a novel and more efficient search strategy with a selection operation is introduced into QPSO to improve the search ability of QPSO. While the center of position distribution of each particle in QPSO is determined by global best position and personal best position, in the Modified QPSO (MQPSO), the global best position is substituted by a personal best position of a randomly selected particle. The MQPSO also maintains the mean best position of the swarm as in the previous QPSO to make the swarm more efficient in global search. The experiment results on benchmark functions show that MQPSO has stronger global search ability than QPSO and PSO. © Springer-Verlag Berlin Heidelberg 2007.