Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8
description
Transcript of Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8
![Page 1: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/1.jpg)
Ant Colony Optimization Algorithms for TSP: 3-6 to
3-8Timothy Hahn
February 13, 2008
![Page 2: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/2.jpg)
3.6.1 Behavior of ACO Algorithms
• TSPLIB instance burma14
• Grayscale image White (No pheromone) Black (High pheromone)
• After various instances 0 (top left) 5 (top right) 10 (botton left) 100 (bottom right)
![Page 3: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/3.jpg)
3.6.1 Behavior of ACO Algorithms• Stagnation – all ants follow the same path and
same solution• Methods of measuring stagnation
Standard Deviation (σL) Variation Coefficient (σL)/μL) Average distance between paths
• dist(T,T’) = number of arcs in T but not in T’ Average Branching Factor
• τij ≥ τimin + λ(τi
max - τimin)
Average Entropy•
ij
l
jiji pp
1
log
![Page 4: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/4.jpg)
Behavior of Ant Systems
Average Branching Factor Average Distance
![Page 5: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/5.jpg)
Behavior of Extensions of AS
.Average Branching Factor Average Distance
![Page 6: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/6.jpg)
Behavior of Extensions of AS
. d198 instance rat783 instance
![Page 7: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/7.jpg)
ACO Plus Local Search• Basic idea: When an ant finds a solution, use a
local search technique to find a local optimum• 2-opt and 2.5-opt have O(n2) complexity, while
3-opt has O(n3) complexity• Tradeoff between spending more time on local
search and less time on ant exploration versus less time on local search and more time on ant exploration 5322 = 283,024 comparisons 5323 = 150,568,768 comparisons
• Using nearest neighbor lists and reduce the number of required comparisons
![Page 8: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/8.jpg)
2-opt Local Search
![Page 9: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/9.jpg)
2.5-opt Local Search
![Page 10: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/10.jpg)
3-opt Local Search
![Page 11: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/11.jpg)
Local Search Results
. pcb1173 instance pr2392 instance
![Page 12: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/12.jpg)
Number of Ants Results
. pcb1173 instance pr2392 instance
![Page 13: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/13.jpg)
Heuristic Information Results
. MMAS ACS
![Page 14: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/14.jpg)
Pheromone Update Results
. MMAS ACS
![Page 15: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/15.jpg)
Data Representation
![Page 16: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/16.jpg)
Basic Algorithm
![Page 17: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/17.jpg)
Constructing Solutions
![Page 18: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/18.jpg)
AS Decision Rule
![Page 19: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/19.jpg)
NeighborListASDecisionRule
![Page 20: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/20.jpg)
ChooseBestNext
![Page 21: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/21.jpg)
Updating Pheromones
![Page 22: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/22.jpg)
AS: Deposit Pheromone
![Page 23: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/23.jpg)
ACS: Deposit Pheromone
![Page 24: Ant Colony Optimization Algorithms for TSP: 3-6 to 3-8](https://reader035.fdocuments.net/reader035/viewer/2022062315/56816133550346895dd08ba6/html5/thumbnails/24.jpg)
3.9 Bibliographical Remarks
• TSP is among the oldest (1800s) and most studied combinatorial optimization problems
• Algorithms have been developed capable of solving TSP with over 85,900 cities
• ACO algorithms are not competitive with current approximation methods for TSP (solutions to millions of cities within a reasonable time that are 2-3% of optimal)
• ACO algorithms work very well on other NP Complete problems