Particle swarm optimisation: time for uniformisation

Particle swarm optimisation PSO is an evolutionary algorithm that has been successfully applied to many optimisation problems in different fields. PSO has been heuristically proposed based in a social analogy for large groups in nature. Since its publication, research has been carried to understand the PSO convergence and improving its numerical performance. Accordingly several modifications of the basic PSO have been proposed, mostly in a heuristic way. Nevertheless, many of these modifications were not really needed, since they were proposed based on a deficient mathematical analysis of the PSO stability conditions. PSO trajectories are stochastic processes and PSO can be considered as a discrete stochastic gradient algorithm. Nevertheless, PSO is not heuristic, since its convergence and the stability of particle trajectories are related. In conclusion, it is time for uniformisation, because paradoxically this wide range of PSO versions have generated mistrust, providing the impression that PSO success depends more on the version that has been adopted and on the skills of the PSO designer.

[1]  J. Fernández-Martínez,et al.  Stochastic Stability Analysis of the Linear Continuous and Discrete PSO Models , 2011, IEEE Transactions on Evolutionary Computation.

[2]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[3]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[4]  Russell C. Eberhart,et al.  Tracking and optimizing dynamic systems with particle swarms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[5]  E. Ozcan,et al.  Particle swarm optimization: surfing the waves , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  J. F. Martínez,et al.  The generalized PSO: a new door to PSO evolution , 2008 .

[7]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

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

[9]  Esperanza García Gonzalo,et al.  The PSO family: deduction, stochastic analysis and comparison , 2009, Swarm Intelligence.

[10]  Juan Luis Fernández-Martínez,et al.  Theoretical analysis of particle swarm trajectories through a mechanical analogy , 2008 .

[11]  Leandro dos Santos Coelho,et al.  Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization Problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Andries Petrus Engelbrecht,et al.  A study of particle swarm optimization particle trajectories , 2006, Inf. Sci..

[13]  Jing J. Liang,et al.  Evaluation of Comprehensive Learning Particle Swarm Optimizer , 2004, ICONIP.

[14]  Shiyuan Yang,et al.  Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm , 2007, Inf. Process. Lett..

[15]  Juan Luis Fern.  Stochastic Stability Analysis of the Linear Continuous and Discrete PSO Models , 2011 .

[16]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[17]  Riccardo Poli,et al.  Dynamics and stability of the sampling distribution of particle swarm optimisers via moment analysis , 2008 .

[18]  Juan Luis Fernández-Martínez,et al.  STOCHASTIC STABILITY AND NUMERICAL ANALYSIS OF TWO NOVEL ALGORITHMS OF THE PSO FAMILY: PP-GPSO AND RR-GPSO , 2012 .

[19]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.