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.
Keywords
Particle swarm optimizationConvergence (economics)Stability (learning theory)Multi-swarm optimizationMathematical optimizationSet (abstract data type)Swarm behaviourTrajectoryPopulationComputer scienceMathematicsAlgorithmMachine learningPhysics
Affiliated Institutions
Related Publications
A modified particle swarm optimizer
Evolutionary computation techniques, genetic algorithms, evolutionary strategies and genetic programming are motivated by the evolution of nature. A population of individuals, w...
A new optimizer using particle swarm theory
The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently develope...
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
ROBUST MODELING WITH ERRATIC DATA
An attractive alternative to least‐squares data modeling techniques is the use of absolute value error criteria. Unlike the least‐squares techniques the inclusion of some infini...
Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
Abstract. The expectation‐maximization (EM) algorithm is a popular approach for obtaining maximum likelihood estimates in incomplete data problems because of its simplicity and ...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 6
- Issue
- 1
- Pages
- 58-73
- Citations
- 8683
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
8683
OpenAlex
Cite This
Maurice Clerc,
James Kennedy
(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
Identifiers
- DOI
- 10.1109/4235.985692