Particle Swarm Optimization
Particle Swarm Optimization
Particle Swarm Optimization
Stelios Petrakis
Contents
Swarm Intelligence & Applications
Particle Swarm Optimization
How it works?
Algorithm / Pseudocode
Examples
Applets / Demos
Matlab Toolbox
References
Swarm Intelligence
Definition
Swarm intelligence is artificial intelligence, based on the
collective behavior of decentralized, self-organized systems.
The expression was introduced by Gerardo Beni and Jing
Wang in 1989, in the context of cellular robotic systems.
Swarm Intelligence
Information
Swarm intelligence systems are typically made up of a population of
simple agents interacting locally with one another and with their
environment.
The agents follow very simple rules, and although there is no centralized
control structure dictating how individual agents should behave, local
interactions between such agents lead to the emergence of complex
global behavior.
Natural examples of SI include ant colonies, bird flocking, animal
herding, bacterial growth, and fish schooling.
Initialize Population
Random initial positions
Random initial velocities
Particle Properties
With Particle Swarm Optimization, a swarm of particles (individuals) in a ndimensional search space G is simulated, where each particle p has a position p.g
G Rn and a velocity p.v Rn.
The position p.g corresponds to the genotypes, and, in most cases, also to the
solution candidates, i. e., p.x = p.g, since most often the problem space X is also
the Rn and X = G. However, this is not necessarily the case and generally, we can
introduce any form of genotype-phenotype mapping in Particle Swarm
Optimization.
The velocity vector p.v of an individual p determines in which direction the
search will continue and if it has an explorative (high velocity) or an exploitive
(low velocity) character.
Neighbourhood
p , q Pop : q N ( p ) dist eucl ( p.g , q.g )
Population
Topological Neighbours
p.x
Pseudocode
For each particle
initialize particle
End For
Do
For each particle
calculate fitness value
if the fitness value is better than the best fitness value (pBest) in history
set current value as the new pBest
End
choose the particle with the best fitness value of all the particles as the gBest
For each particle
calculate particle velocity according to previous equations
update particle position according to previous equations
End
While maximum iterations or minimum error criteria is not attained
New algorithms
A Modied PSO Structure Resulting in High
Exploration Ability With Convergence
Guaranteed (Chen & Li, 2007)
Decreasing coefcient to the updating principle
Applets / Examples
http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=7506
http://www.borgelt.net//psopt.html
http://pages.cpsc.ucalgary.ca/%7Ekhemka/pso/download.html
http://www.projectcomputing.com/resources/psovis/index.html
http://www.particleswarm.info/Programs.html
http://clerc.maurice.free.fr/pso/
http://www.red3d.com/cwr/boids/
http://uk.geocities.com/markcsinclair/pso.html
References
http://tracer.uc3m.es/tws/pso/basics.html
http://en.wikipedia.org/wiki/Swarm_intelligence
http://en.wikipedia.org/wiki/Particle_swarm_optimization
http://www.engr.iupui.edu/~shi/Coference/psopap4.html
http://www.cis.syr.edu/~mohan/pso/
http://www.swarmintelligence.org/
Papers / Books
The Generalized PSO: A New Door to PSO
Evolution (Martinez & Gonzalo, 2008)
A Modied PSO Structure Resulting in High
Exploration Ability With Convergence
Guaranteed (Chen & Li, 2007)
Emergent Social Structures in Cultural
Algorithms (Reynolds, Peng & Whallon, 2005)
Global Optimization Algorithms, Theory and
Application ( Thomas Weise, 2008)
Thanks!