A particle swarm searching for the global minimum of a function
Part of a series on the
Evolutionary algorithm
Artificial development
Artificial life
Cellular evolutionary algorithm
Cultural algorithm
Differential evolution
Effective fitness
Evolutionary computation
Evolution strategy
Gaussian adaptation
Grammar induction
Evolutionary multimodal optimization
Particle swarm optimization
Memetic algorithm
Natural evolution strategy
Neuroevolution
Promoter based genetic algorithm
Spiral optimization algorithm
Self-modifying code
Polymorphic code
Genetic algorithm
Chromosome
Clonal selection algorithm
Crossover
Mutation
Genetic memory
Genetic fuzzy systems
Selection
Fly algorithm
Genetic programming
Cartesian genetic programming
Linear genetic programming
Grammatical evolution
Multi expression programming
Genetic Improvement
Schema
Eurisko
Parity benchmark
v
t
e
In computational science, particle swarm optimization (PSO)[1] is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formula over the particle's position and velocity. Each particle's movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions.
PSO is originally attributed to Kennedy, Eberhart and Shi[2][3] and was first intended for simulating social behaviour,[4] as a stylized representation of the movement of organisms in a bird flock or fish school. The algorithm was simplified and it was observed to be performing optimization. The book by Kennedy and Eberhart[5] describes many philosophical aspects of PSO and swarm intelligence. An extensive survey of PSO applications is made by Poli.[6][7] In 2017, a comprehensive review on theoretical and experimental works on PSO has been published by Bonyadi and Michalewicz.[1]
PSO is a metaheuristic as it makes few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. Also, PSO does not use the gradient of the problem being optimized, which means PSO does not require that the optimization problem be differentiable as is required by classic optimization methods such as gradient descent and quasi-newton methods. However, metaheuristics such as PSO do not guarantee an optimal solution is ever found.
^ abCite error: The named reference bonyadi16survey was invoked but never defined (see the help page).
^Cite error: The named reference kennedy95particle was invoked but never defined (see the help page).
^Cite error: The named reference shi98modified was invoked but never defined (see the help page).
^Cite error: The named reference kennedy97particle was invoked but never defined (see the help page).
^Cite error: The named reference kennedy01swarm was invoked but never defined (see the help page).
^Cite error: The named reference poli07analysis was invoked but never defined (see the help page).
^Cite error: The named reference poli08analysis was invoked but never defined (see the help page).
and 24 Related for: Particle swarm optimization information
In computational science, particleswarmoptimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate...
Gaussian adaptation, hill climbing, and swarm intelligence (e.g.: ant colony optimization, particleswarmoptimization) and methods based on integer linear...
differential evolution (DE), particleswarmoptimization (PSO), and other methods. Attempts have been made to solve multi-modal optimization in all these realms...
self-organized agents in a population or swarm. Ant colony optimization, particleswarmoptimization, social cognitive optimization and bacterial foraging algorithm...
generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from...
based on the theories of Isaac Newton, that heat was an indestructible particle that had mass. Clausius discovered that the non-usable energy increases...
comparison of two evolutionary algorithms in portfolio optimization: Genetic and particleswarmoptimization". 2010 2nd IEEE International Conference on Information...
possible to perform the search using some other method, such as particleswarmoptimization (see the remark below); the modular nature of GE creates many...
problem being optimized, which means DE does not require the optimization problem to be differentiable, as is required by classic optimization methods such...
Yuhui Shi is a pioneer in particleswarmoptimization algorithms and the developer of brain storm optimization algorithms. He was an electrical engineer...
Vincent, Jonathan; Anyakoha, Chukwudi (July 2007). "A review of particleswarmoptimization. Part I: background and development". Natural Computing. 6 (4):...
Sociocultural evolution Stochastic optimizationSwarm intelligence M. Omran, A novel cultural algorithm for real-parameter optimization. International Journal of...
also uses Lévy flights, and thus it suits for global optimization problems. Particleswarmoptimization is based on the ideas of animal flocking behaviour...
Symphony Orchestra In science and technology: Particleswarmoptimization, a swarm intelligence optimization technique Password Settings Object, used in...
CALYPSO - The Crystal structure AnaLYsis by ParticleSwarmOptimization, implementing the particleswarmoptimization (PSO) algorithm to identify/determine...
Global Information