A Study of Collapse in Bare Bones Particle Swarm Optimization
Author:
- 29 September 2011
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 16 (3) , 354-372
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Bare Bones Particle Swarm Optimization with Gaussian or Cauchy jumps2009
- An analysis of Bare Bones Particle Swarm2008
- Examination of Particle TailsJournal of Artificial Evolution and Applications, 2008
- A Simplified Recombinant PSOJournal of Artificial Evolution and Applications, 2008
- Origin of bursts2007
- Defining a Standard for Particle Swarm Optimization2007
- Gaussian Particle Swarm with Jumps2005
- The Fully Informed Particle Swarm: Simpler, Maybe BetterIEEE Transactions on Evolutionary Computation, 2004
- Bare bones particle swarms2004
- Evolutionary programming made fasterIEEE Transactions on Evolutionary Computation, 1999