Ant Colony Optimization

Problem

Number of Cities

Number of Ants

Pheromone Importance (α)

1.0

Distance Importance (β)

2.0

Evaporation Rate

10%

Iteration

∞

Best Tour

Current Best

Improvement

Convergence History

ACO Algorithm (Dorigo 1991): Ants deposit pheromone on edges. Higher pheromone = more likely to be chosen. Good paths get reinforced; bad paths evaporate.