Abstract
In this paper, the probabilistic nearest neighbor heuristic, which is at the core of classical ant colony systems for the Traveling Salesman Problem, is replaced by an alternative insertion procedure known as the GENI heuristic. The benefits provided by GENI-based ants are empirically demonstrated on a set of benchmark problems, through a comparison with the classical ant colony system and an iterated GENI heuristic.
Similar content being viewed by others
References
Bonabeau, E., M. Dorigo, and G. Theraulaz. (2000). “Inspiration for Optimization from Social Insect Behavior.” Nature 406, 39-42.
Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). “Applying the Ant System to the Vehicle Routing Problem.” In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristics — Advances and Trends in Local Search Paradigms for Optimization. Kluwer, pp. 285-296.
Dorigo, M. (1992). “Optimization, Learning and Natural Algorithms.” Ph.D. Dissertation, Departimento di Elettronica, Politecnico di Milano, Italy (in Italian).
Dorigo, M., E. Bonabeau, and G. Theraulaz. (2000). “Ant Algorithms and Stigmergy.” Future Generation Computer Systems 16, 851-871.
Dorigo, M. and G. Di Caro. (1999). “The Ant Colony Optimization Meta-Heuristic”, In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London, UK: McGraw-Hill, pp. 11-32.
Dorigo, M., G. Di Caro, and L.M. Gambardella. (1999). “Ant Algorithms for Discrete Optimization.” Arti-ficial Life 5, 137-172.
Dorigo, M. and L.M. Gambardella. (1997). “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.” IEEE Transactions on Evolutionary Computation 1, 53-66.
Dorigo, M., V. Maniezzo, and A. Colorni. (1996). “Ant System: Optimization by a Colony of Cooperating Agents.” IEEE Transactions on Systems, Man and Cybernetics 26, 29-41.
Gambardella, L.-M. and M. Dorigo. (2000). “Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem.” INFORMS Journal on Computing 12, 237-255.
Gambardella, L.-M., E.D. Taillard, and M. Dorigo. (1999). “Ant Colonies for the Quadratic Assignment Problem.” Journal of the Operational Research Society 50, 167-176.
Gendreau, M., A. Hertz, and G. Laporte. (1992). “New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.” Operations Research 40, 1086-1094.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Schmoys (eds.). (1985). The Traveling Salesman Problem. Wiley.
Lin, S. (1965). “Computer Solutions of the Traveling Salesman Problem.” Bell System Technical Journal 44, 2245-2269.
Reinelt, G. (1991). “TSPLIB — A Traveling Salesman Problem Library.” ORSA Journal on Computing 3, 376-384.
Stützle, T. and H.H. Hoos. (2000). “MAX-MIN Ant System.” Future Generation Computer Systems Journal 16, 889-914.
Whitley, D. (1989). “The GENITOR Algorithm: Why Rank-Based Allocation of Reproductive Trials Is Best.” In J.D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 116-121.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Le Louarn, FX., Gendreau, M. & Potvin, JY. GENI Ants for the Traveling Salesman Problem. Ann Oper Res 131, 187–201 (2004). https://doi.org/10.1023/B:ANOR.0000039518.73626.a5
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000039518.73626.a5