An Improved Diversity Guided Particle Swarm Optimization

Particle swarm optimization (PSO) is a new population based stochastic search algorithm, which has shown good performance on well-known numerical test problems. However, on strongly multimodal test problems the PSO easily suffers from premature convergence. In this paper, an improved diversity guided PSO is proposed, namely IARPSO, which combines a diversity guided PSO (ARPSO) and a Cauchy mutation operator. The purpose of IARPSO is to enhance the global search ability of ARPSO by Conducting a Cauchy mutation on the global best particle. Experimental results on 6 multimodal functions with many local minima show that the IARPSO outperforms the standard PSO, ARPSO and ATRE-PSO on all test functions.

[1]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[2]  A. E. Eiben,et al.  Evolutionary Programming VII , 1998, Lecture Notes in Computer Science.

[3]  Millie Pant,et al.  A Simple Diversity Guided Particle Swarm Optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[4]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[5]  Hui Wang,et al.  A Hybrid Particle Swarm Algorithm with Cauchy Mutation , 2007, 2007 IEEE Swarm Intelligence Symposium.

[6]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[7]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  Russell C. Eberhart,et al.  Recent advances in particle swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Wang Zhi-gang,et al.  A modified particle swarm optimization , 2009 .

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