Particle swarm optimization with triggered mutation and its implementation based on GPU

A novel particle swarm optimization with triggered mutation (PSO-TM) is presented in this paper for better performance. First, a technique is designed to evaluate the "health" of swarm. When the swarm is successively "unhealthy" for a certain number of iterations, uniform mutation is applied to the position of each particle in a probabilistic way. If the mutations produce worse particles, the memorized previous positions are retrieved as current positions of these particles, hence the normal evolution process of the swarm will not be fiercely interrupted by such bad mutations. Experiments are conducted on 29 benchmark test functions to show the promising performance of our proposed PSOTM. The results show that the PSO-TM performs much better than the standard PSO on almost all of the 29 test functions, especially those multimodal, complex ones of hybrid composition. Besides, PSO-TM adds little computation complexity to the standard PSO, and runs almost equally fast. Furthermore, we have implemented PSO-TM based on Graphic Processing Unit(GPU) in parallel. Compared with the CPU-based standard PSO, the proposed PSO-TM can reach a speedup of 25×, as well as an improved optimizing performance.

[1]  A. Engelbrecht,et al.  A new locally convergent particle swarm optimiser , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[2]  James Kennedy,et al.  Defining a Standard for Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[3]  Hitoshi Iba,et al.  Particle swarm optimization with Gaussian mutation , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[4]  Ying Tan,et al.  GPU-based parallel particle swarm optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[5]  Thomas Kiel Rasmussen,et al.  Hybrid Particle Swarm Optimiser with breeding and subpopulations , 2001 .

[6]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[7]  Chu Kiong Loo,et al.  A new class of operators to accelerate particle swarm optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[8]  Ning Li,et al.  Particle swarm optimization with mutation operator , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

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

[10]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[11]  Weihang Zhu,et al.  Particle Swarm with graphics hardware acceleration and local pattern search on bound constrained problems , 2009, 2009 IEEE Swarm Intelligence Symposium.

[12]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[13]  A. Stacey,et al.  Particle swarm optimization with mutation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[15]  Carlos A. Coello Coello,et al.  On the use of particle swarm optimization with multimodal functions , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[16]  Andries Petrus Engelbrecht,et al.  Using neighbourhoods with the guaranteed convergence PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).