Scribd
Upload
47 views26 pages

Inspired From The Nature Social Behavior and Dynamic Movements With Communications of Insects, Birds and Fish

The document describes particle swarm optimization (PSO), which was inspired by the flocking behavior of birds and fish. PSO is an optimization technique that models a population of solutions as particles moving through a search space. Each particle adjusts its position based on its own experience and the experience of neighboring particles. The algorithm iteratively improves the particles' positions to locate the best solution. PSO has advantages like simplicity and efficiency for global optimization problems.

Uploaded by

VijayKumar Lokanadam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
47 views26 pages

Inspired From The Nature Social Behavior and Dynamic Movements With Communications of Insects, Birds and Fish

The document describes particle swarm optimization (PSO), which was inspired by the flocking behavior of birds and fish. PSO is an optimization technique that models a population of solutions as particles moving through a search space. Each particle adjusts its position based on its own experience and the experience of neighboring particles. The algorithm iteratively improves the particles' positions to locate the best solution. PSO has advantages like simplicity and efficiency for global optimization problems.

Uploaded by

VijayKumar Lokanadam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

Inspired from the nature social behavior and dynamic

movements with communications of insects, birds and


fish
In 1986, Craig Reynolds described this process in 3
simple behaviors:

Separation Alignment Cohesion


avoid crowding local move towards the average move toward the average
flockmates heading of local position of local
flockmates flockmates
Application to optimization: Particle Swarm
Optimization

Proposed by James Kennedy & Russell Eberhart (1995)

Combines self-experiences with social experiences


Uses a number of agents (particles)
that constitute a swarm moving
around in the search space looking
for the best solution

Each particle in search space adjusts


its flying according to its own
flying experience as well as the
flying experience of other particles
Collection of flying particles (swarm) - Changing
solutions

Search area - Possible solutions

Movement towards a promising area to get the global


optimum

Each particle keeps track:


its best solution, personal best, pbest

the best value of any particle, global best, gbest


Each particle adjusts its travelling speed
dynamically corresponding to the flying
experiences of itself and its colleagues
Each particle modifies its
position according to:
its current position
its current velocity

the distance between its


current position and pbest

the distance between its


current position and gbest
geographical

social
global
Algorithm parameters
A : Population of agents

pi : Position of agent ai in the solution space

f : Objective function

vi : Velocity of agents ai

V(ai) : Neighborhood of agent ai (fixed)

The neighborhood concept in PSO is not the same as


the one used in other meta-heuristics search, since in
PSO each particles neighborhood never changes (is
fixed)
[x*] = PSO()
P = Particle_Initialization();
For i=1 to it_max
For each particle p in P do
fp = f(p);
If fp is better than f(pBest)
pBest = p;
end
end
gBest = best p in P;
For each particle p in P do
v = v + c1*rand*(pBest p) + c2*rand*(gBest p);
p = p + v;
end
end
Particle update rule
p=p+v
with
v = v + c1 * rand * (pBest p) + c2 * rand * (gBest p)
where
p: particles position
v: path direction
c1: weight of local information
c2: weight of global information
pBest: best position of the particle
gBest: best position of the swarm
rand: random variable
Number of particles usually between 10 and 50

C1 is the importance of personal best value

C2 is the importance of neighborhood best value

Usually C1 + C2 = 4 (empirically chosen value)

If velocity is too low algorithm too slow

If velocity is too high algorithm too unstable


1. Create a population of agents (particles) uniformly
distributed over X

2. Evaluate each particles position according to the


objective function

3. If a particles current position is better than its previous


best position, update it

4. Determine the best particle (according to the particles


previous best positions)
5. Update particles velocities:

6. Move particles to their new positions:

7. Go to step 2 until stopping criteria are satisfied


Particles velocity:

1. Inertia Makes the particle move in the same


direction and with the same velocity

Improves the individual


2. Personal Makes the particle return to a previous
Influence position, better than the current
Conservative

3. Social Makes the particle follow the best


Influence neighbors direction
Intensification: explores the previous solutions, finds
the best solution of a given region

Diversification: searches new solutions, finds the


regions with potentially the best solutions

In PSO:
Advantages
Insensitive to scaling of design variables
Simple implementation
Easily parallelized for concurrent processing
Derivative free
Very few algorithm parameters
Very efficient global search algorithm

Disadvantages
Tendency to a fast and premature convergence in mid optimum
points
Slow convergence in refined search stage (weak local search
ability)
Several approaches
2-D Otsu PSO
Active Target PSO
Adaptive PSO
Adaptive Mutation PSO
Adaptive PSO Guided by Acceleration Information
Attractive Repulsive Particle Swarm Optimization
Binary PSO
Cooperative Multiple PSO
Dynamic and Adjustable PSO
Extended Particle Swarms

Davoud Sedighizadeh and Ellips Masehian, Particle Swarm Optimization Methods, Taxonomy and Applications.
International Journal of Computer Theory and Engineering, Vol. 1, No. 5, December 2009

You might also like