Article

Origin of bursts

Authors:

Daniel BrattonAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

Pages 2613 - 2620

https://doi.org/10.1145/1274000.1274076

Published: 07 July 2007 Publication History

Abstract

The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the study of first order stochastic difference equations. The work here demonstrates that bursts contribute to fattening of the tail of the particle position distribution and that these tails are well described by power laws. It is argued that recombinant PSO, a competitive PSO variant without multiplicative randomness, is burst-free.

References

[1]

D. Bratton and T. M. Blackwell. Understanding particle swarms through simplification: A study of recombinant pso. In Submitted to Particles swarms: the second decade, workshop, GECCO 2007, 2007.

Digital Library

[2]

D. Bratton and J. Kennedy. Defining a standard for particle swarm optimization. In IEEE swarm intelligence symposium, 2007.

[3]

M. Clerc and J. Kennedy. The particle swarm: explosion, stability and convergence in a multi-dimensional space. IEEE transactions on Evolutionary Computation, 6:158--73, 2000.

Digital Library

[4]

A. Engelbrecht. Fundamentals of computational swarm intelligence. John Wiley and Sons Ltd., 2005.

Digital Library

[5]

J. D. Hamilton. Time series analysis. Princeton university press, 1994.

[6]

J. Kennedy. Bare bones particle swarms. In IEEE swarm intelligence symposium, pages 80--87, 2003.

[7]

J. Kennedy. Probability and dynamics in the particle swarm. In IEEE congress on evolutionary computation, pages 340--347, 2004.

[8]

J. Kennedy and R. Mendes. Neighbor topologies in fully-informed and best-of-neighborhood particle swarms. In IEEE int'l workshop on soft computing in industrial applications, pages 45--50, 2003.

[9]

M. E. Newman. Power laws, pareto distributions and zipf's law. Contemporary physics, 46(5):323--351, 2005.

[10]

E. Ott. Chaos in dynamical systems. Cambridge University Press, New York, 2002.

[11]

E. Ozcan and C. K. Mohan. particle swarm optimization: surfing the waves. In IEEE congress on evolutionary computation, 1999.

[12]

C. T. P. Bak and K. Wiesenfeld. Self-organized criticality: an explanation for 1/f noise. Phys. Rev. Lett, 59:381--384, 1987.

[13]

J. Pena, A. Upegui, and E. Sanchez. Particle swarm optimization with discrete recombination: an online optimizer for evolvable hardware. In First NASA/ESA conference on adaptive hardware and systems, AHS '06, pages 163--170, 2007.

Digital Library

[14]

R. Poli. Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation. In GECCO (submitted), 2007.

Digital Library

[15]

S. Redner. Random multiplicative processes. Am. J. Phys, 58:267--273, 1990.

[16]

T. Richer and T. Blackwell. The levy particle swarm. In IEEE congress on evolutionary computation, pages 3150--3157, 2006.

[17]

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 Proc. foundations of genetic algorithms (FOGA) workshop, 2007.

Digital Library

[18]

Y. Shi and R. Eberhart. A modified particle swarm optimizer. In Congress on Evolutionary Computation, pages 69--73, 1998.

[19]

D. Sornette. Multiplicative processes and power laws. Phys. Rev. E, 57:4811--4813, 1998.

[20]

D. Sornette. Mechanism for powerlaws without self-organization. Int. J. Mod. Phys., pages 133--136, 2001.

[21]

D. Sornette and R. Cont. Convergent multiplicative processes repelled from zero: power laws and truncated power laws. J. Phys. I France, 7:431--444, 1997.

[22]

F. van den Burgh. An analysis of particle swarm optimizers. PhD thesis, University of Pretoria, 2002.

[23]

G. K. Zipf. Human behaviour and the principle of least action. Addison Wesley, Reading, MA, 1949.

Cited By

al-Rifaie MBlackwell T(2018)Cognitive Bare Bones Particle Swarm Optimisation with JumpsInternational Journal of Swarm Intelligence Research10.4018/IJSIR.20160101017:1(1-31)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.4018/IJSIR.2016010101
Blackwell T(2018)A Study of Collapse in Bare Bones Particle Swarm OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2011.213634716:3(354-372)Online publication date: 25-Dec-2018
https://dl.acm.org/doi/10.1109/TEVC.2011.2136347
Bratton DBlackwell T(2008)A simplified recombinant PSOJournal of Artificial Evolution and Applications10.1155/2008/6541842008:S1(1-10)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1155/2008/654184
Show More Cited By

Index Terms

Origin of bursts
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction

Recommendations

A Modified Quantum-Behaved Particle Swarm Optimization
ICCS '07: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007

Based on the previously introduced Quantum-behaved Particle Swarm Optimization (QPSO), a revised QPSO with Gaussian disturbance on the mean best position of the swarm is proposed. The reason for the introduction of this novel method is that the ...
Self-Adaptive Particle Swarm Optimization
Simulated Evolution and Learning
Abstract
Particle swarm optimization (PSO) has been used to solve a wide variety of optimization problems. The basic PSO algorithm contains a number of control parameters, including the inertia weight, w, and the acceleration coefficients, c₁ and c₂. The ...
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients

This paper introduces a novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations. Initially, to efficiently control the local search and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

July 2007

1450 pages

ISBN:9781595936981

DOI:10.1145/1274000

Program Chairs:
Peter A. N. Bosman
Centre for Mathematics & Computer Science, The Netherlands
,
Tina Yu
Memorial University of Newfoundland, Canada
,
Anikó Ekárt
Aston University, UK

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, United Kingdom

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
161
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

al-Rifaie MBlackwell T(2018)Cognitive Bare Bones Particle Swarm Optimisation with JumpsInternational Journal of Swarm Intelligence Research10.4018/IJSIR.20160101017:1(1-31)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.4018/IJSIR.2016010101
Blackwell T(2018)A Study of Collapse in Bare Bones Particle Swarm OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2011.213634716:3(354-372)Online publication date: 25-Dec-2018
https://dl.acm.org/doi/10.1109/TEVC.2011.2136347
Bratton DBlackwell T(2008)A simplified recombinant PSOJournal of Artificial Evolution and Applications10.1155/2008/6541842008:S1(1-10)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1155/2008/654184
Peña JRyan C(2008)Theoretical and empirical study of particle swarms with additive stochasticity and different recombination operatorsProceedings of the 10th annual conference on Genetic and evolutionary computation10.1145/1389095.1389109(95-102)Online publication date: 13-Jul-2008
https://dl.acm.org/doi/10.1145/1389095.1389109
Bratton DBlackwell TBosman PYu TEkárt A(2007)Understanding particle swarms through simplificationProceedings of the 9th annual conference companion on Genetic and evolutionary computation10.1145/1274000.1274078(2621-2628)Online publication date: 7-Jul-2007
https://dl.acm.org/doi/10.1145/1274000.1274078

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten