Process / pipeline
Particle Swarm Optimization (PSO)
Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI: 10.1109/ICNN.1995.488968 ↗
- Shi, Y. & Eberhart, R. (1998). A Modified Particle Swarm Optimizer. IEEE Congress on Evolutionary Computation (CEC). link ↗
Related methods
Referenced by
African Vultures Optimization AlgorithmAgent-based ant colony optimizationAgent-based genetic algorithmAnt Colony OptimizationAquila OptimizerArithmetic Optimization AlgorithmArtificial Bee ColonyBat AlgorithmBayesian Genetic AlgorithmBayesian Particle Swarm OptimizationCuckoo SearchDeterministic Particle Swarm OptimizationEvolutionary StrategyFirefly AlgorithmGenetic AlgorithmGrey Wolf OptimizerHarmony SearchHarris Hawks OptimizationHoney Badger AlgorithmJellyfish Search OptimizerMulti-objective particle swarm optimizationNSGA-IINSGA-IIIPolicy Scenario Particle Swarm OptimizationRobust Particle Swarm OptimizationRunge Kutta OptimizerSimulated AnnealingSlime Mould AlgorithmStochastic Genetic AlgorithmStochastic Particle Swarm OptimizationStochastic Tabu SearchTabu SearchWhale Optimization Algorithm