Difference between revisions 166798565 and 167314304 on enwiki

< previous diff
next diff >
Repulsive particle swarm optimization
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>\mathbf{z}</math> : a random velocity vector
*<math>a,b,c</math> : constants

The repulsion property is realized for a negative <math>b</math>.
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 of 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.
 ⏎
This type of RPSO was first introduced in [http://www.google.com/search?q=Robust+estimation+of+camera+rotation,+translation+and+focal+length+at+high+outlier+rates&ie=UTF-8&oe=UTF-8] as an application to a robust estimation problem.
==References==
* Urfalioglu, O., Robust estimation of camera rotation, translation and focal length at high outlier rates, CRV04, [http://www.visionbib.com/bibliography/motion-i790.html#TT57032]

==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://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]]