this paper we give an overview on the available ACO algorithms for the TSP. We first introduce, in Section 1.2, the TSP. In Section 1.3 we outline how ACO algorithms can be applied to that problem and present the available ACO algorithms for the TSP. Section 1.4 briefly discusses local search for the TSP, while Section 1.5 presents experimental results which have been obtained with MAX --MIN Ant System, one of the improved versions of Ant System. Since the first application of ACO algorithms to the TSP, they have been applied to several other combinatorial optimization problems. On many important problems ACO algorithms have proved to be among the best available algorithms. In Section 1.6 we give a concise overview of these other applications of ACO algorithms. 1.2 THE TRAVELING SALESMAN PROBLEM
|
7271
|
Computers and Intractability - A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
530
|
A.: Ant System: Optimization by a colony of cooperating agents
– Dorigo, Maniezzo, et al.
- 1996
|
|
377
|
Ant colony system: A cooperative learning approach to the traveling salesman problem
– Dorigo, Gambardella
- 1997
|
|
258
|
The Traveling Salesman Problem
– Lawler, Lenstra, et al.
- 1985
|
|
236
|
An effective heuristic algorithm for the traveling salesman problem
– Lin, Kernighan
- 1973
|
|
222
|
The ant colony optimization meta-heuristic
– Dorigo
- 1999
|
|
208
|
The traveling salesman problem: A case study in local optimization
– Johnson, McGeoch
- 1996
|
|
195
|
Computer solutions of the traveling salesman problem
– Lin
- 1965
|
|
192
|
TSPLIB { A traveling salesman problem library
– Reinelt
- 1991
|
|
154
|
AntNet: Distributed stigmergetic control for communications networks
– Caro
- 1998
|
|
141
|
Distributed optimization by ant colonies
– Colorni, Dorigo, et al.
- 1991
|
|
128
|
Fitness distance correlation as a measure of problem difficulty for genetic algorithms
– Jones, Forrest
- 1995
|
|
128
|
The Traveling Salesman: Computational Solutions for TSP Applications
– Reinelt
- 1994
|
|
116
|
Ant-based load balancing in telecommunications networks
– Schoonderwoerd, Holland, et al.
- 1997
|
|
112
|
Fast algorithms for geometric traveling salesman problems
– Bentley
- 1992
|
|
105
|
La reconstruction du nid et les coordinations inter-individuelles chez Bellicositermes natalensis et Cubitermes sp. La théorie de la stigmergie: Essai d’interprétation du comportement des termites constructeurs
– Grassé
- 1959
|
|
96
|
The Ant System applied to the quadratic assignment problem
– Maniezzo, Colorni
- 1999
|
|
91
|
A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16:101{113
– Boese, Kahng, et al.
- 1994
|
|
82
|
MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Technical report IDSIA-06-99, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA
– Gambardella, Taillard
- 1999
|
|
80
|
Positive feedback as a search strategy
– Dorigo, Maniezzo, et al.
- 1991
|
|
79
|
Ants can colour graphs
– Costa, Hertz
- 1997
|
|
78
|
Large-step Markov chains for the traveling salesman problem
– Martin, Otto, et al.
- 1991
|
|
75
|
Ant-Q: A reinforcement learning approach to the traveling salesman problem
– Gambardella, Dorigo
- 1995
|
|
73
|
Combining simulated annealing with local search heuristics
– Martin, Otto
- 1996
|
|
67
|
Ant System for job-shop scheduling
– Colorni, Dorigo, et al.
- 1994
|
|
61
|
An improved ant system algorithm for the vehicle routing problem
– Bullnheimer, Hartl
- 1999
|
|
59
|
Genetic Local Search for the TSP: New Results
– Merz, Freisleben
- 1997
|
|
59
|
H.H.: The MAX –MIN Ant System and local search for the traveling salesman problem
– Stützle, Hoos
- 1997
|
|
50
|
A method for solving traveling salesman problems
– Croes
- 1958
|
|
48
|
Local Search Algorithms for Combinatorial Problems - Analysis, Algorithms, and New Applications
– Stützle
- 1998
|
|
47
|
A genetic local search algorithm for solving symmetric and assymetric traveling salesman problem
– Freisleben, Merz
- 1996
|
|
45
|
Ant colonies for QAP
– Gambardella, Taillard, et al.
- 1997
|
|
44
|
Solving symmetric and asymmetric TSPs by ant colonies
– Gambardella, Dorigo
- 1996
|
|
43
|
Applying the Ant System to the vehicle routing problem
– Bullnheimer, Hartl, et al.
- 1999
|
|
43
|
M.: ACO Algorithms for the Quadratic Assignment Problem
– Stützle, Dorigo
- 1999
|
|
41
|
HAS-SOP: Hybrid ant system for the sequential ordering problem
– Gambardella
- 1997
|
|
40
|
Edge Assembly Crossover: A High–power Genetic Algorithm for the Traveling Salesman Problem
– Nagata, Kobayashi
- 1997
|
|
39
|
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
– Maniezzo
- 1999
|
|
39
|
An ant approach to the flow shop problem
– Stutzle
- 1998
|
|
36
|
Models for Iterative Global Optimization
– Boese
- 1996
|
|
36
|
Improvements on the ant system, introducing the MAX-MIN ant system
– Stützle, Hoos
- 1997
|
|
22
|
G.: From Natural to Artificial Swarm Intelligence
– Bonabeau, Dorigo, et al.
- 1999
|
|
21
|
Ant algorithms for distributed discrete optimization
– Dorigo, Caro, et al.
- 1999
|
|
21
|
Asparagos96 and the Traveling Salesman Problem
– Gorges-Schleuter
- 1997
|
|
17
|
Results of the first international contest on evolutionary optimization
– Bersini, Dorigo, et al.
|
|
14
|
Repair and brood selection in the traveling salesman problem
– Walters
- 1998
|
|
13
|
A New Rank Based Version of the Ant System
– Bullnheimer, Hartl, et al.
- 1999
|
|
12
|
Adaptive Approach Heuristics for the Generalized Assignment Problem. Economic Working
– LourenGo, Serra
- 1998
|
|
9
|
Combinatorial Optimization by Iterative Partial Transcription
– Möbius, Freisleben, et al.
- 1999
|
|
8
|
ant system and local search for combinatorial optimization problems
– --MIN
- 1999
|
|
