MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

The Ant System: Optimization by a colony of cooperating agents (1996) [530 citations — 49 self]

by Marco Dorigo ,  Vittorio Maniezzo ,  Alberto Colorni
IEEE Transactions on Systems, Man, and Cybernetics-Part B
Add To MetaCart

Abstract:

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical Traveling Salesman Problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the Ant System (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadrat...

Citations

350 Tabu search { part I – Glover - 1989
315 Simulated annealing and Boltzmann machines – Aarts, Korst - 1989
199 Tabu search, part II – Glover - 1989
141 Distributed optimization by ant colonies – Colorni, Dorigo, et al. - 1991
112 Fast algorithms for geometric traveling salesman problems – Bentley - 1992
86 Optimization, learning and natural algorithms – Dorigo - 1992
86 Scheduling problems and travelling salesman: the genetic edge recombination operator – Whitley, Starkweather, et al. - 1989
80 Positive feedback as a search strategy – Dorigo, Maniezzo, et al. - 1991
67 Ant System for job-shop scheduling – Colorni, Dorigo, et al. - 1994
65 Evolutionsstrategie und numerische Optimierung – Schwefel - 1975
61 An experimental comparison of techniques for the assignment of facilities to locations – Nugent, Vollmann, et al. - 1969
38 An investigation of some properties of the ant algorithm – Colorni, Dorigo, et al. - 1992
29 Hospital layout as a quadratic assignment problem – Elshafei - 1977
24 The Immune Recruitment Mechanism: A Selective Evolutionary Strategy – Bersisni, Varela - 1991
24 Computer-aided Layout Design – Krarup, Pruzan - 1978
22 Collective patterns and decision-making – Deneubourg, Goss - 1989
18 Heuristics from Nature for Hard Combinatorial Problems – Colorni, Maffioli, et al.
15 Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Operations Research 5 – Graham, Lawler, et al. - 1979
14 M.P.Vecchi, "Optimization by Simulated Annealing – Kirkpatrick - 1983
14 An effective heuristic algorithm for the TSP – Lin, Kernighan - 1973
12 A.H.G.Rinnooy Kan, "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey – Graham, Lenstra - 1979
11 An additive bounding procedure for the asymmetric travelling salesman problem – Fischetti, Toth - 1992
6 Empiric analysis of heuristics," in The Travelling Salesman Problem – Golden - 1985
4 Quadratic Assignment Problems – Burkhard - 1984
3 N.Christofides, "Distribution management: mathematical modeling and practical analysis – Eilon - 1969
3 A.H.G.Rinnooy-Kan, D.B.Shmoys eds., The Travelling Salesman Problem – Lawler - 1985
3 The Ant System Applied to the Quadratic Assignment – Maniezzo, Colorni - 1994
1 J.C.Verhaeghe, "Probabilistic Behaviour in Ants: a Strategy of Errors – Deneubourg - 1983
1 26 Dorigo et al.: Ant System: Optimization by a Colony of Cooperating Agents – Goldberg - 1989
1 1.0, Institut für Mathematik, Universität – Reinelt - 1990
1 1.0, Institut fr Mathematik, Universitt – Reinelt - 1990
View or Download | Add to My Collection | Correct Errors