Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm

https://doi.org/10.1016/j.ipl.2006.10.005Get rights and content

Abstract

This letter presents a formal stochastic convergence analysis of the standard particle swarm optimization (PSO) algorithm, which involves with randomness. By regarding each particle's position on each evolutionary step as a stochastic vector, the standard PSO algorithm determined by non-negative real parameter tuple {ω,c1,c2} is analyzed using stochastic process theory. The stochastic convergent condition of the particle swarm system and corresponding parameter selection guidelines are derived.

References (9)

  • I.C. Trelea

    The particle swarm optimization algorithm: Convergence analysis and parameter selection

    Information Processing Letters

    (2003)
  • A. Carlisle, G. Dozier, An off-the-shelf PSO, in: Proceedings of the Workshop on Particle Swarm Optimization,...
  • M. Clerc et al.

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

    IEEE Transactions on Evolutionary Computation

    (2002)
  • J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proc. IEEE International Conference on Neural Networks,...
There are more references available in the full text version of this article.

Cited by (0)

View full text