A novel particle swarm optimization algorithm

A novel particle swarm optimization (NPSO) algorithm with dynamically changing inertia weight based on fltness and iterations was presented for improving the performance of the Particle Swarm Optimization algorithm. The new algorithm was tested with three benchmark functions. The experimental results show that the swarm can escape from local optimum, and it also can speed up the convergence of particles to improve the performance.

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

[2]  Thomas E. Potok,et al.  Document clustering using particle swarm optimization , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[3]  David B. Fogel,et al.  A Note on the Empirical Evaluation of Intermediate Recombination , 1995, Evolutionary Computation.

[4]  R. W. Dobbins,et al.  Computational intelligence PC tools , 1996 .

[5]  福見 稔.  "1995 IEEE International Conference on Neural Networks"に出席して , 1996 .

[6]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Ai-Qin Mu,et al.  A Modified Particle Swarm Optimization Algorithm , 2009 .

[8]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[9]  Junjun Li,et al.  A Modified Particle Swarm Optimization Algorithm , 2004, 2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing.

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.