. Ant Colony Optimization (ACO) is a class of constructive metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This tutorial is composed of three parts. The rst one frames the ACO approach in current trends of research on metaheuristic algorithms for combinatorial optimization; the second outlines current research within the ACO framework, reporting recent results obtained on dierent problems, while the third part focuses on a particular research line, the ANTS metaheuristic, providing some details on the algorithm and presenting results recently obtained on the quadratic and on the frequency assignment problems. 1. Introduction Complex societal systems pose a lot of problems of combinatorial nature. Trucks have to be routed, depots or sale points have to be located, communication networks have to be designed, containers have to be lled...
|
1170
|
Genetic algorithms in search, optimization, and machine learning
– Goldberg
- 1989
|
|
853
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
530
|
A.: Ant System: Optimization by a colony of cooperating agents
– Dorigo, Maniezzo, et al.
- 1996
|
|
378
|
Tabu search
– Glover, Laguna
- 1993
|
|
377
|
Ant colony system: A cooperative learning approach to the traveling salesman problem
– Dorigo, Gambardella
- 1997
|
|
304
|
A greedy randomized adaptative search procedure for the two-partition problem
– Laguna, Feo, et al.
- 1994
|
|
236
|
An effective heuristic algorithm for the traveling salesman problem
– Lin, Kernighan
- 1973
|
|
222
|
The ant colony optimization meta-heuristic
– Dorigo
- 1999
|
|
187
|
Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing
– Aarts, Korst
- 1989
|
|
141
|
Distributed optimization by ant colonies
– Colorni, Dorigo, et al.
- 1991
|
|
141
|
Algorithms for the vehicle routing and scheduling problem with time window constraints”, Operation Research 35
– Solomon
- 1987
|
|
96
|
The Ant System applied to the quadratic assignment problem
– Maniezzo, Colorni
- 1999
|
|
93
|
Heuristics for integer programming using surrogate constraints
– Glover
- 1977
|
|
93
|
Robust taboo search for the quadratic assignment problem
– Taillard
- 1991
|
|
86
|
Optimization, learning and natural algorithms
– Dorigo
- 1992
|
|
84
|
A greedy randomized adaptive search procedure for the quadratic assignment problem
– Li, Pardalos, et al.
- 1994
|
|
83
|
AntNet: A Mobile Agents Approach to Adaptive Routing, Universite Libre de Bruxelles
– Caro, Dorigo
- 1997
|
|
80
|
Positive feedback as a search strategy
– Dorigo, Maniezzo, et al.
- 1991
|
|
79
|
Ants can colour graphs
– Costa, Hertz
- 1997
|
|
75
|
Ant-Q: A reinforcement learning approach to the traveling salesman problem
– Gambardella, Dorigo
- 1995
|
|
69
|
A tabu search heuristic for the vehicle routing problem with soft time windows
– Guertin, Potvin
- 1997
|
|
67
|
Ant System for job-shop scheduling
– Colorni, Dorigo, et al.
- 1994
|
|
61
|
Ant colonies for the quadratic assignment problem
– Gambardella, Taillard, et al.
- 1999
|
|
45
|
Ant colonies for QAP
– Gambardella, Taillard, et al.
- 1997
|
|
39
|
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
– Maniezzo
- 1999
|
|
36
|
Improvements on the ant system, introducing the MAX-MIN ant system
– Stützle, Hoos
- 1997
|
|
30
|
The vehicle routing problem with time windows. part 1: Tabu search
– Kervahut, Rousseau
- 1996
|
|
28
|
Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Working Paper
– Thangiah, Osman, et al.
- 1994
|
|
23
|
MAX − MIN Ant System and local search for combinatorial optimization problems
– Stützle, Hoos
- 1998
|
|
22
|
A new rank-based version of the Ant System: A computational study
– Bullnheimer, Hartl, et al.
- 1999
|
|
18
|
Routing in Telecommunications Networks with "Smart" Ant-Like Agents. Santa Fe Institute
– Bonabeau, Henaux, et al.
- 1998
|
|
14
|
An overview of algorithmic approaches to frequency assignment problems
– Tiourine, Hurkens, et al.
- 1995
|
|
13
|
An ANTS heuristic for the frequency assignment problem
– Maniezzo, Carbonaro
- 2000
|
|
13
|
An island model based Ant System with lookahead for the shortest supersequence problem
– Michel, Middendorf
- 1998
|
|
12
|
A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system
– Anderson
- 1973
|
|
7
|
GRAPH: Generating Radio link frequency Assignment Problems Heuristically
– Benthem
- 1995
|
|
5
|
Ant colonies for vehicle routing problems
– Gambardella, Taillard, et al.
- 1999
|
|
4
|
Hybrid Heuristics for the Vehicle Routing Problem with Time Windows, Working Paper
– Chiang, Russel
- 1993
|
|
3
|
distributed stigmergetic control for communications networks
– Antnet
- 1998
|
|
3
|
search and star-paths: Beyond the genetic metaphor
– Scatter
- 1995
|
|
3
|
An exact algorithm for the radio link frequency assignment problem
– Maniezzo, Montemanni
- 1999
|
|
3
|
Probabilistic Diversi and Intensi in Local Search for Vehicle Routing
– Rochat, Taillard
- 1995
|
|
1
|
The bionomic algorithm
– Christo
- 1994
|
|
1
|
der Put, Routing in packet switched networks using agents
– van
- 1998
|
