Scribd
Upload
6 views20 pages

Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a meta-heuristic algorithm inspired by the social behavior of birds, which searches for optimal solutions by updating generations of particles. Each particle represents a potential solution and adjusts its position based on its own experience and that of its neighbors, tracking personal and global bests. The document also discusses the application of PSO to the Traveling Salesman Problem (TSP), detailing the initialization and update processes for particle velocity and position.

Uploaded by

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

Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a meta-heuristic algorithm inspired by the social behavior of birds, which searches for optimal solutions by updating generations of particles. Each particle represents a potential solution and adjusts its position based on its own experience and that of its neighbors, tracking personal and global bests. The document also discusses the application of PSO to the Traveling Salesman Problem (TSP), detailing the initialization and update processes for particle velocity and position.

Uploaded by

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

Particle Swarm Optimization

Introduction to PSO
• Meta-heuristic algorithm
• Inspired from the nature social behavior and dynamic
movements with communications of insects, birds and fish
• Searches optimal value by updating generations
• Swarm – population of moving particles
Introduction to PSO
• Inspired by social behaviour of birds flocking (move together
in a crowd)
• Group of birds are flying randomly and searching for food in
an area
• There is only one piece of food in the area being searched
• All birds do not know where food is, but they know how far
they are in each iteration
• Each bird can fly in different directions
• Search strategy: Follow the bird which is nearest to the food
• Birds do not know the best position
• If any member can find out a disable path to go, the rest of
the members will follow
Introduction to PSO
PSO
• Each member of the population is called a particle. Each
particle is a solution
• Population is called swarm
• Each particle has velocities
• Velocity of a particle: Speed of particle in a given direction
• Starting with a randomly initialized population and moving
in randomly chosen directions
• Each particle remembers the best previous positions of itself
and its neighbors
PSO
Each particle keeps track:

its best solution, personal best, pbest

the best value of any particle, global best, gbest


PSO
PSO
PSO
• 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


PSO for TSP
PSO for TSP
Particle velocity update
PSO for TSP
Particle velocity update
PSO for TSP
Particle solution update
PSO for TSP
Subtract two permutations
PSO for TSP
PSO for TSP
Initialization of Solution and Velocity
Particle Permutation Velocity Fitness
1 CAEBDC (2,1)(3,2)
2 BDEACB (2,4)(5,1)
3 ABDECA (4,3)(1,4)
4 DABECD (3,5)(4,5)
5 ACDEBA (2,4)(1,3)
PSO for TSP
Iteration1: Update velocity and position of all particles
Update of Particle 1:
PSO for TSP
Iteration1: Update velocity and position of all particles
Update of Particle 2:

You might also like