论文信息 - Ant Systems

Ant Systems

This article describes Ant Systems, a meta-heuristic based on an ant foraging metaphor. The presentation of Ant Systems has been somewhat generalized by adding a ``Queen" process in charge of co-ordinating classical ``Ant" processes, so that recent Ant Systems can be naturally included while remaining close to the metaphor. To illustrate how Ant Systems are practically implemented, a number of applications to the quadratic assignment problem are reviewed.

E. D. Taillard | É. Taillard

[1] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[2] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .

[3] Piero Mussio,et al. Toward a Practice of Autonomous Systems , 1994 .

[4] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[5] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[6] Éric D. Taillard,et al. FANT: Fast ant system , 1998 .

[7] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[8] Vittorio Maniezzo,et al. Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[9] M Dorigo,et al. Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[10] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .

[11] Luca Maria Gambardella,et al. Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..