0% found this document useful (0 votes)
137 views

Particle Swarm Optimization (PSO)

Particle swarm optimization (PSO) is a population-based stochastic optimization technique inspired by bird flocking and fish schooling behavior. PSO initializes a population of random solutions called particles and searches for the optimal solution by updating each particle's velocity and position based on its own experience and the experience of neighboring particles. PSO shares similarities with evolutionary algorithms but does not use evolution operators like crossover and mutation. PSO has been successfully applied to problems like function optimization and neural network training due to its easy implementation and few adjustable parameters.

Uploaded by

xavierlth
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
137 views

Particle Swarm Optimization (PSO)

Particle swarm optimization (PSO) is a population-based stochastic optimization technique inspired by bird flocking and fish schooling behavior. PSO initializes a population of random solutions called particles and searches for the optimal solution by updating each particle's velocity and position based on its own experience and the experience of neighboring particles. PSO shares similarities with evolutionary algorithms but does not use evolution operators like crossover and mutation. PSO has been successfully applied to problems like function optimization and neural network training due to its easy implementation and few adjustable parameters.

Uploaded by

xavierlth
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

Particle Swarm

Optimization (PSO)

Overview of Basic PSO


1) Particle swarm optimization (PSO) is a population (swarm intelligence) based on
stochastic optimization algorithms to find a solution and then solve an optimization
problem in a search space.
2) It has been developed by Eberhart and Kennedy in 1995, inspired by social behavior
of bird flocking or fish schooling.

How can birds or fish exhibit such


a coordinated collective behavior?

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Overview of Basic PSO

Pseudo-code for PSO

The Flowchart of PSO


Generate and initialize particles with
random position (X) and velocity (V)
Particle m
..
Particle 1

Evaluate position (Fitness)


If fitness(X) >fitness(Pbest)
Pbest=X

Update
Position

If fitness(X) >fitness(Gbest)
Gbest=X

Update
velocity

Termination criterion is met? (e.g.,


Gbest=sufficient good fitness or maximum
generations)

No
Return the best solution

Yes

Aspects of Basic PSO

Aspects of Basic PSO (movement


of particles
n

Original velocity
Velocity toward Gbest

X1 (t 1)

Velocity toward Pbest


Resultant velocity

X 1 (t )

Gbest
Pbest ( X1 )

Particle 1

X 2 (t )

Particle 2
Global best

Pbest ( X 2 )

Personal best
X 2 (t 1)

Individual particles (1 and 2) are accelerated toward the location of the global
best solution (Gbest) and the location of their own personal best (Pbest) in the
n-dimensional space.

Aspects of Basic PSO

Aspects of Basic PSO

Aspects of Basic PSO

PSO shares many similarities with


evolutionary computation techniques such
as Genetic Algorithms (GA).
The system is initialized with a population of
random solutions and searches for optima by
updating generations.
However, unlike GA, PSO has no evolution
operators such as crossover and mutation.
In PSO, the potential solutions, called
particles, fly through the problem space by
following the current optimum particles.
Compared to GA, the advantages of PSO are
that PSO is easy to implement and there are
few parameters to adjust.
PSO has been successfully applied in many
areas: function optimization, artificial neural
network training, fuzzy system control, and

You might also like