A Study of Collapse in Bare Bones Particle Swarm Optimization

The dynamic update rule of particle swarm optimization is formulated as a second-order stochastic difference equation and general relations are derived for search focus, search spread, and swarm stability at stagnation. The relations are applied to three particular particle swarm optimization (PSO) implementations, the standard PSO of Clerc and Kennedy, a PSO with discrete recombination, and the Bare Bones swarm. The simplicity of the Bare Bones swarm facilitates theoretical analysis and a further no-collapse condition is derived. A series of experimental trials confirms that Bare Bones situated at the edge of collapse is comparable to other PSOs, and that performance can be still further improved with the use of an adaptive distribution. It is conjectured that, subject to spread, stability and no-collapse, there is a single encompassing particle swarm paradigm, and that an important aspect of parameter tuning within any particular manifestation is to remove any deleterious behavior that ensues from the dynamics.

[1]  G. Parisi,et al.  Statistical Field Theory , 1988 .

[2]  David E. Booth.  Time Series (3rd ed.) , 2012 .

[3]  Renato A. Krohling,et al.  Bare Bones Particle Swarm Optimization with Gaussian or Cauchy jumps , 2009, 2009 IEEE Congress on Evolutionary Computation.

[4]  D. Broomhead,et al.  Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation , 2007, GECCO '07.

[5]  Riccardo Poli,et al.  Particle Swarm Optimisation , 2011 .

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

[7]  Andres Upegui,et al.  Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware , 2006, First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06).

[8]  Linus Pauling,et al.  Introduction to Quantum Mechanics with Applications to Chemistry , 1935 .

[9]  Xin Yao,et al.  Evolutionary programming using mutations based on the Levy probability distribution , 2004, IEEE Transactions on Evolutionary Computation.

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

[11]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[12]  Kevin D. Seppi,et al.  Exposing origin-seeking bias in PSO , 2005, GECCO '05.

[13]  David B. Fogel,et al.  Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking , 1996, Evolutionary Programming.

[14]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1998 .

[15]  Renato A. Krohling,et al.  Gaussian particle swarm with jumps , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

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

[18]  Tim Blackwell,et al.  A simplified recombinant PSO , 2008 .

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

[20]  Russell C. Eberhart,et al.  An analysis of Bare Bones Particle Swarm , 2008, 2008 IEEE Swarm Intelligence Symposium.

[21]  Tim Blackwell,et al.  Examination of particle tails , 2008 .

[22]  Jorge Peña,et al.  Theoretical and empirical study of particle swarms with additive stochasticity and different recombination operators , 2008, GECCO '08.

[23]  Shiyuan Yang,et al.  Stagnation Analysis in Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[24]  Zhijian Wu,et al.  An improved Particle Swarm Optimization with adaptive jumps , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[25]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[26]  Tim Blackwell,et al.  Origin of bursts , 2007, GECCO '07.

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

[28]  Jorge Peña,et al.  Simple Dynamic Particle Swarms without Velocity , 2008, ANTS Conference.

[29]  Tim M. Blackwell,et al.  The Lévy Particle Swarm , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[30]  Riccardo Poli,et al.  Mean and Variance of the Sampling Distribution of Particle Swarm Optimizers During Stagnation , 2009, IEEE Transactions on Evolutionary Computation.

[31]  James Kennedy,et al.  Bare bones particle swarms , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).