Facebook
Instagram
Youtube
LinkedIn
Twitter
Whatsapp
Lingaya's Vidyapeeth (Deemed-to-be University) u/s 3 of UGC Act 1956
PARTICLE SWARM OPTIMIZATION AND IT’S APPLICATIONS

PARTICLE SWARM OPTIMIZATION AND IT’S APPLICATIONS

PSO algorithm is the swarm-based intelligence algorithm. It is a modern optimization evolutionary technique inspired by the social behavior of flock of birds. Being it’s Origin in 1995, time to time several modifications of PSO have been developed with many application areas. PSO is widely used in many fields because it is very easy to implement, and give the result after each iteration. After each iteration, it gives the two best values Pbest and Gbest. 1st value is related to the cognitive part, and 2ndvalue is related to the social part of the PSO algorithm.

PSO technique mimics the behavior of birds that do not have any leader in their group of swarm. Every particle in the PSO algorithm can communicate to the other particles. They can take every information about the food source to the other particles and from previous experience also. This process shall be repeated several times till the best optimal point is obtained. The whole process of PSO depends on two main parameters Inertia weight and two acceleration factors.

The role of inertia weight is considered most important in PSO. Therefore, a proper control of inertia weight is considered very important to find the optimum solution. Shi and Eberhart made an improvement in the convergence of the PSO with a linearly varying inertia weights over the iterations. There are many optimization areas where we can use this algorithm. Some of them are:

  1. Energy storage optimization.
  2. Scheduling electrical loads.
  3. Flood control and routing.
  4. Disease detection and classification.
  5. Medical image segmentation.
  6. Water quality monitoring.
  7. Agriculture monitoring

PSO is an evolutionary computational technique for updating velocity and position which is defined as:

   Vi [t + 1] = Vi[t] + c1 ∗ r1 ∗ ( Pbest i[t] − Xi[t]) + c2 ∗ r2 ∗ (Gbest i − Xi[t])

                Xi[t + 1] = Xi[t] + Vi[t + 1]

 

 

                                                                                                                    Priyavada

                                                                                                      Assistant Professor (SOBAS)

                                                                                                       Department of Mathematics

August 8, 2023

Copyrights © 1998 - 2024 Lingaya's Vidyapeeth (Deemed To Be University). All rights reserved.

Privacy Policy