Particle Swarms: The Second DecadeView this Special Issue
Research Article | Open Access
Tim Blackwell, Dan Bratton, "Examination of Particle Tails", Journal of Artificial Evolution and Applications, vol. 2008, Article ID 893237, 10 pages, 2008. https://doi.org/10.1155/2008/893237
Examination of Particle Tails
The tail of the particle swarm optimisation (PSO) position distribution at stagnation is shown to be describable by a power law. This tail fattening is attributed to particle bursting on all length scales. The origin of the power law is concluded to lie in multiplicative randomness, previously encountered in the study of first-order stochastic difference equations, and generalised here to second-order equations. It is argued that recombinant PSO, a competitive PSO variant without multiplicative randomness, does not experience tail fattening at stagnation.
- A. Engelbrecht, Fundamentals of Computational Swarm Intelligence, John Wiley & Sons, New York, NY, USA, 2005.
- J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Australia, 1995.
- R. Poli, J. Kennedy, and T. Blackwell, “Particle swarm optimization: an overview,” Swarm Intellligence, vol. 1, no. 1, pp. 33–57, 2007.
- J. Kennedy, “Bare bones particle swarms,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '03), pp. 80–87, Indianapolis, Ind, USA, April 2003.
- T. Richer and T. Blackwell, “The Lévy particle swarm,” in IEEE Congress on Evolutionary Computation (CEC '06), pp. 3150–3157, Vancouver, Canada, July 2006.
- R. Poli, W. Langdon, M. Clerc, and C. Stephens, “Continuous optimisation made easy? Finite element models of evolutionary strategies, genetic algorithms and particle swarm optimisers,” in Proceedings of the Foundations of Genetic Algorithms Workshop (FOGA '07), Mexico City, Mexico, January 2007.
- J. Kennedy, “Dynamic-probabilistic particle swarms,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '05), pp. 201–207, Washington, DC, USA, June 2005.
- J. Kennedy, “Probability and dynamics in the particle swarm,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 1, pp. 340–347, Portland, Ore, USA, June 2004.
- D. Sornette, “Multiplicative processes and power laws,” Physical Review E, vol. 57, no. 4, pp. 4811–4813, 1998.
- J. Peña, A. Upegui, and E. Sanchez, “Particle swarm optimization with discrete recombination: an online optimizer for evolvable hardware,” in Proceedings of the1st NASA/ESA Conference on Adaptive Hardware and Systems (AHS '06), pp. 163–170, Istanbul, Turkey, June 2006.
- D. Bratton and J. Kennedy, “Defining a standard for particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '07), pp. 120–127, Honolulu, Hawaii, USA, April 2007.
- Y. Shi and R. Eberhart, “Modified particle swarm optimizer,” in Proceedings of the IEEE Conference on Evolutionary Computation (ICEC '98), pp. 69–73, Anchorage, Alaska, USA, May 1998.
- J. Kennedy and R. Mendes, “Neighbor topologies in fully-informed and best of-neighborhood particle swarms,” in Proceedings of the IEEE International Workshop on Soft Computing in Industrial Applications (SMCia '03), pp. 45–50, June 2003.
- M. Clerc and J. Kennedy, “The particle swarm—explosion, stability and convergence in a multi-dimensional space,” IEEE transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2000.
- R. Sornette, “Linear stochastic dynamics with nonlinear fractal properties,” Physica A, vol. 250, no. 1–4, pp. 295–314, 1998.
- J. D. Hamilton, Time Series Analysis, Princeton University Press, Princeton, NJ, USA, 1994.
- E. Ozcan and C. K. Mohan, “Particle swarm optimization: surfing the waves,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, p. 1944, Washington, DC, USA, July 1999.
- F. ven den Burgh, An analysis of particle swarm optimizers, Ph.D. thesis, University of Pretoria, Pretoria, South Africa, 2002.
- R. Poli and D. Broomhead, “Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 134–141, London, UK, July 2007.
- G. K. Zipf, Human Behaviour and the Principle of Least Action, Addison Wesley, Reading, Mass, USA, 1949.
- M. E. J. Newman, “Power laws, Pareto distributions and Zipf's law,” Contemporary Physics, vol. 46, no. 5, pp. 323–351, 2005.
- C. T. P. Bak and K. Wiesenfeld, “Self-organized criticality: an explanation for 1/f noise,” Physical Review Letters, vol. 59, no. 4, pp. 381–384, 1987.
- D. Sornette, “Mechanism for power laws without self-organization,” International Journal of Modern Physics, vol. 13, no. 2, pp. 133–136, 2001.
- E. Ott, Chaos in Dynamical Systems, Cambridge University Press, New York, NY, USA, 2002.
- S. Redner, “Random multiplicative processes,” American Journal of Physics, vol. 58, no. 3, pp. 267–273, 1990.
- D. Sornette and R. Cont, “Convergent multiplicative processes repelled from zero: power laws and truncated power laws,” Journal de Physique I France, vol. 7, pp. 431–444, 1997.
- D. Bratton and T. Blackwell, “A simplified recombinant PSO,” to appear in Artificial Evolution and Applications.
- D. Bratton and T. Blackwell, “Understanding particle swarms through simplification: a study of recombinant PSO,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 2621–2628, London, UK, July 2007.
- M. Clerc, Particle Swarm Optimization, ISTE, London, UK, 2006.
Copyright © 2008 Tim Blackwell and Dan Bratton. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.