GENI ants for the traveling salesman problem

Annals of Operations Research

Volumn 131, Issue 1-4, 2004, Pages 187-201

  Le Louarn, François Xavier ^a   Gendreau, Michel ^a   Potvin, Jean Yves ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

ant colony system; generalized insertion; traveling salesman problem

Indexed keywords

EID: 4444326964     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000039518.73626.a5     Document Type: Article

References (16)

1. Bonabeau, E., M. Dorigo, and G. Theraulaz. (2000). "Inspiration for Optimization from Social Insect Behavior." Nature 406, 39-42.
2. 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.
3. Dorigo, M. (1992). "Optimization, Learning and Natural Algorithms." Ph.D. Dissertation, Departimento di Elettronica, Politecnico di Milano, Italy (in Italian).
4. Dorigo, M., E. Bonabeau, and G. Theraulaz. (2000). "Ant Algorithms and Stigmergy." Future Generation Computer Systems 16, 851-871.
5. 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.
6. Dorigo, M., G. Di Caro, and L.M. Gambardella. (1999). "Ant Algorithms for Discrete Optimization." Artificial Life 5, 137-172.
7. 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.
8. 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.
9. 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.
10. 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.
11. Gendreau, M., A. Hertz, and G. Laporte. (1992). "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem." Operations Research 40, 1086-1094.
12. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Schmoys (eds.). (1985). The Traveling Salesman Problem. Wiley.
13. Lin, S. (1965). "Computer Solutions of the Traveling Salesman Problem." Bell System Technical Journal 44, 2245-2269.
14. Reinelt, G. (1991). "TSPLIB - A Traveling Salesman Problem Library." ORSA Journal on Computing 3, 376-384.
15. Stützle, T. and H.H. Hoos. (2000). "MAX-MIN Ant System." Future Generation Computer Systems Journal 16, 889-914.
16. 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.