A Quantum Particle Swarm Optimization Algorithm Based on Self-Updating Mechanism

The living mechanism has limited life in nature; it will age and die with time. This article describes that during the progressive process, the aging mechanism is very important to keep a swarm diverse. In the quantum behavior particle swarm (QPSO) algorithm, the particles are aged and the algorithm is prematurely convergent, the self-renewal mechanism of life is introduced into QPSO algorithm, and a leading particle and challengers are introduced. When the population particles are aged and the leading power of leading particle is exhausted, a challenger particle becomes the new leader particle through the competition update mechanism, group evolution is completed and the group diversity is maintained, and the global convergence of the algorithm is proven. Next in the article, twelve Clement2009 benchmark functions are used in the experimental test, both the comparison and analysis of results of the proposed method and classical improved QPSO algorithms are given, and the simulation results show strong global finding ability of the proposed algorithm. Especially in the seven multi-model test functions, the comprehensive performance is optimal.