Difference between revisions 19092646 and 35127802 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). 

(contracted; show full)
*<math>\hat{\mathbf{x}}</math> : best position of a particle
*<math>\hat{\mathbf{y}}</math> : best position of a randomly chosen other particle from within the swarm
*<math>\mathbf{z}</math> : a random velocity vector
*<math>a,b,c</math> : constants

The main difference between PSO and RPSO is the propagation mechanism to determine new positions for a particle in the search space. 
RPSO is capable 
tof finding global optima in more complex [[search space|search spaces]]. On the other hand, compared to PSO it may be slower on certain types of optimization problems.

==See also==
*[[Particle swarm optimization]]
*[[Ant colony optimization]]
*[[Genetic algorithm]]
*[[Swarm intelligence]]

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

[[Category:Optimization algorithms]]