Traveling Salesman Problem (TSP) Solved using Ant Colony Optimization
(ACO)
1. Problem Description
Given the following distance matrix representing the distances between 4 cities:
[ [0, 10, 15, 20],
[10, 0, 35, 25],
[15, 35, 0, 30],
[20, 25, 30, 0] ]
2. Ant Colony Optimization (ACO) Method
ACO is a metaheuristic inspired by the foraging behavior of ants, using pheromone trails to
probabilistically explore and exploit possible routes.
Key parameters:
Parameter Value
Number of Ants 10
Number of Iterations 100
Alpha (Pheromone Importance) 1
Beta (Heuristic Importance) 5
Evaporation Rate 0.5
Q (Pheromone Constant) 100
3. Result
The best tour found after 100 iterations is:
0→1→3→2→0
Total Distance: 80 units
4. Conclusion
The Ant Colony Optimization algorithm successfully found an optimal path with minimal
distance for the TSP instance provided.