Difference between revisions 310783589 and 328381007 on enwiki

In [[mathematics]], specifically in [[optimization (mathematics)|optimization]], '''repulsive particle swarm optimization'''  ('''RPSO''') is a [[global optimization]] [[algorithm]]. It belongs to the class of [[stochastic|stochastic]] [[evolutionary algorithm|evolutionary]] global optimizers, and is a variant of [[particle swarm optimization]] (PSO). 

There are several different realizations of RPSO. Common to all realizations is the repulsion between particles. This can prevent the [[swarm intelligence|swarm]] being trapped in [[local minimum|local maxima]], which would cause a premature [[convergence (mathematics)limit of a sequence|convergence]] and would lead the optimization algorithm to fail to find the [[global optimum]]. 

In one type of this RPSO-class algorithm, the future [[velocity]] <math>\mathbf{v}_{\mathrm{next}}</math> of a particle at position <math>\mathbf{x}</math> with a recent velocity <math>\mathbf{v}</math> is calculated by

:<math>\mathbf{v}_{\mathrm{next}} = \omega \mathbf{v} + a \ \chi_1 \ (-\mathbf{x}+\hat{\mathbf{x}})
(contracted; show full)
==External links==
*[http://psotoolbox.sourceforge.net Particle Swarm Optimization toolbox] An open source PSO toolbox written in Matlab. *[http://www.particleswarm.info Particle Swarm Central ]
*[http://www1.webng.com/economics FORTRAN Codes for RPSO] FORTRAN 77 Codes for Repulsive Particle Swarm Optimization with a large number of test problems


[[Category:Optimization algorithms]]
[[Category:Evolutionary algorithms]]