A New Adaptive Particle Swarm Optimization Algorithm

A new adaptive particle swarm optimization algorithm is proposed in this paper. Every particle chooses its inertial factor according to the fitness of itself and the optimal particle in the presented algorithm. Simulation results show that the new algorithm has advantage of global convergence property and can effectively alleviate the problem of premature convergence. At the same time, the experimental results also show that the suggested algorithm is greatly superior to PSO and APSO in terms of robustness.

[1]  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).

[2]  Hou Zhi-rong,et al.  Particle Swarm Optimization with Adaptive Mutation , 2006 .

[3]  Jun Tang,et al.  Particle Swarm Optimization with Adaptive Mutation , 2009, 2009 WASE International Conference on Information Engineering.

[4]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[5]  Chen Zhisheng.  A resilient particle swarm optimization algorithm , 2008 .

[6]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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