Difference between revisions 16726282 and 18363012 on enwiki

In [[mathematics]], speficcifically 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]] beeing trapped in [[local minimum|local minima]], which would cause a premature [[convergence|convergence]] and would lead the optimization algorithm to fail to find the [[global optimum]]. 

In RPSO 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

(contracted; show full)
==See also==

*[[Genetic algorithm]]
*[[Swarm intelligence]]

==External links==
*[http://psotoolbox.sourceforge.net Particle Swarm Optimization toolbox] An open source 
psoPSO toolbox written in Matlab. ([http://sourceforge.net/projects/psotoolbox sourceforge home for the project])
*[http://www.particleswarm.info Particle Swarm Central ]

[[Category:Optimization algorithms]]