Abstract:
A population based ACO (Ant Colony Optimization) algorithm is proposed where (nearly) all pheromone information corresponds to solutions that are members of the actual population. Advantages of the population based approach are that it seems promising for solving dynamic optimization problems, its nite state space and the chances it oers for designing new metaheuristics. We compare the behavior of the new approach to the standard ACO approach for several instances of the TSP and the QAP problem. The results show that the new approach is competitive.
Citations
|
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
|
|
222
|
The ant colony optimization meta-heuristic
– Dorigo
- 1999
|
|
61
|
Optimization, learning and natural algorithms (in italian),” Ph.D. dissertation, Dipartimento di Elettronica, Politecnico di
– Dorigo
- 1992
|
|
61
|
Ant colonies for the quadratic assignment problem
– Gambardella, Taillard, et al.
- 1999
|
|
43
|
M.: ACO Algorithms for the Quadratic Assignment Problem
– Stützle, Dorigo
- 1999
|
|
39
|
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
– Maniezzo
- 1999
|
|
38
|
H: MAX-MIN ant system
– Stützle, Hoos
|
|
36
|
Improvements on the ant system, introducing the MAX-MIN ant system
– Stützle, Hoos
- 1997
|
|
10
|
An ant colony optimization approach to dynamic TSP
– Guntsch, Middendorf, et al.
- 2001
|
|
4
|
Pheromone modi strategies for ant algorithms applied to dynamic TSP
– Guntsch, Middendorf
- 2000
|