On Some Properties of the lbest Topology in Particle Swarm Optimization

Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO is mostly based on the gbest (global best) particle topology, which usually is susceptible to false or premature convergence over multi-modal fitness landscapes. The present standard PSO (SPSO 2007) uses an lbest (local best) topology where a particle is stochastically attracted not towards the best position found in the entire swarm, but towards the best position found by any particle in its topological neighborhood. This paper presents a first step towards a probabilistic analysis of the lbest PSO with variable random neighborhood topology by addressing issues like inter-particle interaction and probabilities of selection based on particle ranks.

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

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

[3]  Vladimiro Miranda,et al.  Stochastic Star Communication Topology in Evolutionary Particle Swarms (EPSO) , 2008 .

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

[5]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[6]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[8]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.

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

[10]  Visakan Kadirkamanathan,et al.  Stability analysis of the particle dynamics in particle swarm optimizer , 2006, IEEE Transactions on Evolutionary Computation.

[11]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.

[12]  Swagatam Das,et al.  A closed loop stability analysis and parameter selection of the Particle Swarm Optimization dynamics for faster convergence , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[14]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[15]  Tim Blackwell,et al.  Understanding particle swarms through simplification: a study of recombinant PSO , 2007, GECCO '07.

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

[17]  Ajith Abraham,et al.  Chaotic dynamic characteristics in swarm intelligence , 2007, Appl. Soft Comput..

[18]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[19]  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.