Particle Swarm Optimization (PSO)

Optimisation aims to find the best solution from a set of feasible options under given constraints. In many machine learning and engineering problems, the search space is complex, non-linear and multimodal, where traditional gradient-based methods may be ineffective. This makes population-based optimization techniques more suitable.

Particle Swarm Optimization (PSO) is a stochastic population based optimization technique inspired by swarm intelligence in nature. It is designed to solve complex optimization problems where the search space is large, non-linear or unknown, where traditional deterministic methods are ineffective.

• Each particle represents a potential solution and moves through the search space
• Movement is guided by both individual experience and collective swarm knowledge
• The algorithm iteratively improves solutions using a fitness function
• Simple to implement with fast convergence and few control parameters

How Particle Swarm Optimization (PSO) Works

Particle Swarm Optimization (PSO) is an iterative, population based optimization algorithm. It works by moving a group of particles (candidate solutions) through the search space using simple mathematical rules based on personal and collective experience.

Each particle in PSO has

• Position (x): current solution
• Velocity (v): direction and speed of movement
• Fitness value: quality of the solution

Each particle stores:

• pBest: best position found by itself
• gBest: best position found by the entire swarm

Step 1: Initialization

• Randomly initialize N particles within the search space
• Assign a random velocity to each particle
• Evaluate the fitness value of each particle

pBest = current position
gBest = best pBest among all particles

Step 2: Velocity Update

At each iteration the velocity of a particle is updated using:

where

• : inertia weight (controls exploration)
• : cognitive coefficient (self-learning)
• : social coefficient (swarm learning)
• : random values in [0,1]

Step 3: Position Update

After updating velocity the position is updated as:

If the new position goes outside [minx,maxx] clip it to the boundary.

Step 4: Update Best Positions

• If current fitness is better than pBest, update pBest
• If current fitness is better than gBest, update gBest

Step 5: Convergence

• Repeat Steps 2–4 for a fixed number of iterations or until convergence
• The swarm gradually moves toward the optimal solution

Step By Step Implementation

Here in this code we implements Particle Swarm Optimization (PSO) to find the global minimum of the Ackley function by iteratively updating a swarm of particles based on their personal best and the global best positions.

It simulates collective behavior to efficiently search the solution space and converge to an optimal solution.

Step 1: Import Required Libraries

• Import numpy for numerical computations and vector operations
• Import math for mathematical constants and functions
• Import matplotlib.pyplot for possible visualization

Step 2: Define the Cost (Objective) Function

• The Ackley function is a common benchmark function for optimization algorithms
• It is multimodal, non-convex and difficult for gradient-based methods
• PSO aims to minimize this function

Step 3: Define PSO Hyperparameters

• DIMENSIONS: specifies the search space dimensionality
• POPULATION: represents the number of particles
• MAX_ITER: controls the number of optimization iterations
• MIN_BOUND and MAX_BOUND: define the search space limits
• w, c1 and c2: are inertia, cognitive and social coefficients

Step 4: Define the Particle Class

• Each particle represents a candidate solution
• Particles have position, velocity and personal best
• Fitness is calculated using the cost function
• Personal best is updated whenever a better solution is found

Step 5: Initialize the Swarm and Global Best

• A swarm of particles is created
• The global best solution is selected from all personal bests
• This global best guides the swarm during optimization

Step 6: Update Velocity and Position of Particles

• Velocity update includes inertia, cognitive and social components
• Random factors introduce stochastic behavior
• Velocity and position are clipped to avoid divergence
• This step enables exploration and exploitation

Step 7: Update Personal Best and Global Best

• Fitness is recalculated after position update
• Personal best is updated if a better fitness is achieved
• Global best is updated if any particle outperforms the current best

Step 8: Execute the PSO Algorithm

• The PSO function is executed from the main block
• Final optimal position and fitness value are printed
• The result approximates the global minimum of the Ackley function

Output:

You can download full code from here

Difference between Particle Swarm Optimization (PSO) and Genetic Algorithm (GA)

Here we compare Particle Swarm Optimization (PSO) and Genetic Algorithm(GA):

Application

1. Health Care Applications

• Intelligent Diagnosis: Optimizes models for faster and accurate disease detection.
• Medical Robots: Guides robots for precise surgical or therapeutic tasks.

2. Environmental Applications

• Wild Vegetation Monitoring: Tracks forest and vegetation growth efficiently.
• Agriculture Monitoring: Optimizes crop management and environmental monitoring.
• Flood Control and Routing: Predicts floods and finds optimal evacuation or routing paths.

3. Industrial Applications

• WSN Deployment: Optimizes sensor placement in Wireless Sensor Networks.
• Product Defection Prediction: Predicts defects to improve product quality.
• Microgrid Design and Operation: Optimizes design and operation for stability.

4 Smart City Applications

• Smart City Planning: Optimizes urban energy, traffic and resources.
• Smart Home Automation: Efficiently controls and schedules home appliances.
• Appliance Scheduling: Reduces energy consumption via optimal use.

Advantages

• Simple to implement with fewer control parameters.
• Fast convergence compared to many traditional algorithms.
• Does not require gradient information.
• Effective for non-linear and multimodal problems.
• Easily used with other optimization techniques.

Limitations

• May converge early to local optima.
• Weak local search capability in later iterations.
• Performance depends on proper parameter tuning.
• Computational cost increases with swarm size.
• Less effective for discrete optimization problems.