FINDING SHORTEST PATH

USING
ANT COLONY OPTIMIZATION
Presented By – Suman Rajak (3312)
Debashish Mahato (3356)
Susanta Bisi (3387)

Instructed By – Prof . Shovan Roy (H.O.D of Dept of C.S)

1 15 th June 2023
 CONTENT
S

2 15 th June 2023
 PROBLEM
01 STATEMENT

The problem is to find the shortest path between two points in a graph. We
use Ant Colony Optimization, inspired by how ants find the shortest path.
Virtual ants explore the graph, leaving pheromone trails. The higher the
quality of a path, the stronger the pheromone trail. Ants basically choose
the next city based on pheromone levels and distance.

We repeat this process many times until the ants consistently find the
shortest route. By working together and using the pheromone trails as a
guide, the ants help us find the best path on the graph.

3 15 th June 2023
 RELATED
02 ALGORITHMS
1. Genetic Algorithm (GA) : Genetic Algorithm (GA) is a search-based optimization technique
based on the principles of Genetics and Natural Selection. It is frequently used to find optimal
or near-optimal solutions to difficult problems.

2. Simulated Annealing (SA) : It is a related global optimization technique which traverses the
search space by generating neighboring solutions of the current solution.

3. Reactive Search Optimization (RSO): It is a optimization method that combines the benefits
of local search and global search to efficiently solve complex optimization problems.

4. Tabu search (TS) : It is a metaheuristic optimization algorithm that explores the solution
space by iteratively moving from one solution to another.

5. Stochastic diffusion search (SDS) : It is an agent-based probabilistic global search and

optimization technique best suited to problems where the objective function can be
4 decomposed into multiple independent partial-functions
15 th June 2023
 03 WHY USED
1. Find Optimal Solutions: The primary objective of ACO is to find optimal or near-optimal
solutions to complex optimization problems by simulating the behavior of ants which aims to
discover the most efficient paths.

2. Overcome Combinatorial Complexity: ACO helps tackle combinatorial optimization

problems, which are known for their high computational complexity.

3. Convergence: The objective is to converge on the best solution by following the paths with
the strongest pheromone trails.

4. Handle Dynamic Environments: ACO algorithms can adapt to dynamic environments where
the problem conditions change over time.

5. Balance Exploration and Exploitation: ACO algorithms aim to strike a balance between
exploration and exploitation. Exploration involves discovering new paths or configurations,
5 while exploitation focuses on intensifying the search around promising solutions.
15 th June 2023
 WORKIN
04 G
The way ants find their food in shortest path is interesting.

• Ants secrete pheromones to remember their path.

• These pheromones evaporate with time.
• Whenever an ant finds food , it marks its return journey with pheromones.
• Pheromones evaporate faster on longer paths.
• Shorter paths serve as the way to food for most of the other ants.
• The shorter path will be reinforced by the pheromones further.
• Finally , the ants arrive at the shortest path.
6 15 th June 2023
 We can understand the working using this video

7 15 th June 2023
 05 INPUT
We will input the nodes on the canvas using out mouse pointer.

8 15 th June 2023
 We can control the speed of ants. There are 4 speed settings.

We will click “play” to start traversing the ants between the nodes
and click “stop” to stop traversing.
The “step” button is used to pass one step at a time.

9 15 th June 2023
 We can also input circle and square patterns by putting the
number of circle or patterns.

3 – circle pattern 3 – square pattern

10 15 th June 2023
 We can also input any random diagram by putting the number of
nodes.

11 15 th June 2023
 06 OUTPUT
In output the shortest path among the nodes will be highlighted.

12 15 th June 2023
 We can see the number of iterations, shortest distance and the
shortest path

Number of Shortest Distance

Iterations

Shortest Path

13 15 th June 2023
 07 Applications
Scheduling Problem
• Job-shop scheduling problem (JSP)
• Open-shop scheduling problem (OSP)
• 'k Resource-constrained project scheduling problem (RCPSP)
• Group-shop scheduling problem (GSP)
Assignment problem
• Quadratic assignment problem (QAP)
• Generalized assignment problem (GAP)
• Frequency assignment problem (FAP)
• Redundancy allocation problem

Vehicle routing problem

• Set problem
Multi-depot vehicle routing problem (MDVRP)
• Set covering problem(SCP)
• Period vehicle routing problem (PVRP)
• Set partition problem (SPP)
• Split delivery vehicle routing problem (SDVRP)
• Multiple knapsack problem (MKP)
• Stochastic vehicle routing problem (SVRP)
• Maximum independent set problem (MIS)
• Vehicle routing problem with time windows (VRPTW)

14 15 th June 2023
 08 References
1. M. Dorigo, M. Birattari and T. Stutzle, "Ant colony optimization," in IEEE Computational Intelligence Magazine, vol. 1,
no. 4, pp. 28-39, Nov. 2006, doi: 10.1109/MCI.2006.329691.

2. J. Sun, Y. Yu and L. Xin, "Research on Path Planning of AGV Based on Improved Ant Colony Optimization Algorithm,"
2021 33rd Chinese Control and Decision Conference (CCDC), Kunming, China, 2021, pp. 7567-7572, doi:
10.1109/CCDC52312.2021.9601807.

3. A. Saoji and G. S. Rao, "Hybrid [ACPSO] Integration Approach based on Particle Swarm Optimization and Ant Colony
Optimization to Improve Lifetime of Wireless Sensor Network," 2021 Asian Conference on Innovation in Technology
(ASIANCON), PUNE, India, 2021, pp. 1-4, doi: 10.1109/ASIANCON51346.2021.9544535.

4. I. D. I. D. Ariyasingha and T. G. I. Fernando, "A modified Pareto strength ant colony optimization algorithm for the multi-
objective optimization problems," 2016 IEEE International Conference on Information and Automation for Sustainability
(ICIAfS), Galle, Sri Lanka, 2016, pp. 1-6, doi: 10.1109/ICIAFS.2016.7946519.

5. F. Olivas, F. Valdez and O. Castillo, "A fuzzy system for parameter adaptation in ant colony optimization," 2014 IEEE
Symposium on Swarm Intelligence, Orlando, FL, USA, 2014, pp. 1-6, doi: 10.1109/SIS.2014.7011780.
15 15 th June 2023
 THANKS

16 15 th June 2023