Process / pipelineSimulation / optimization

Stochastic Particle Swarm Optimization — Randomized Swarm-Based Global Search

Stochastic Particle Swarm Optimization (Stochastic PSO) is a swarm-intelligence metaheuristic that extends the standard PSO framework by incorporating explicit stochastic elements — random inertia weights, probabilistic velocity resets, or noise injections — to escape local optima and maintain population diversity throughout the search. It is widely applied to continuous, mixed, and noisy optimization problems in engineering, operations research, and simulation-based design.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4, pp. 1942-1948. IEEE. DOI: 10.1109/ICNN.1995.488968
  2. 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. DOI: 10.1109/4235.985692

Related methods

Referenced by

ScholarGateStochastic Particle Swarm Optimization (Stochastic Particle Swarm Optimization (Stochastic PSO)). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/stochastic-particle-swarm-optimization