Skip to content

The particle swarm - explosion, stability, and convergence in a multidimensional complex space

Maurice Clerc, James Kennedy

IEEE Transactions on Evolutionary Computation · 2002 · 9,183 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Clerc, M., & Kennedy, J. (2002). The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58–73. https://doi.org/10.1109/4235.985692

In text: (Clerc & Kennedy, 2002)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. This paper analyzes a particle's trajectory as it moves in discrete time (the algebraic view), then progresses to the view of it in continuous time (the analytical view). A five-dimensional depiction is developed, which describes the system completely. These analyses lead to a generalized model of the algorithm, containing a set of coefficients to control the system's convergence tendencies. Some results of the particle swarm optimizer, implementing modifications derived from the analysis, suggest methods for altering the original algorithm in ways that eliminate problems and increase the ability of the particle swarm to find optima of some well-studied test functions.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II2002
  2. Particle swarm optimization2002
  3. Optimization by Simulated Annealing1983
  4. Statistical Learning Theory1999
  5. A new optimizer using particle swarm theory2002

Metadata from OpenAlex (CC0). Citations are generated from the published record.