Ant colony system: A cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Volumn 1, Issue 1, 1997, Pages 53-66

  Dorigo, Marco ^a   Gambardella, Luca Maria ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Adaptive behavior; Ant colony; Emergent behavior; Traveling salesman problem

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; LEARNING SYSTEMS; PROBLEM SOLVING; SIMULATED ANNEALING;

ANT COLONY SYSTEMS (ACS); TRAVELING SALESMAN PROBLEM (TSP);

PARALLEL ALGORITHMS;

EID: 0031122887     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.585892     Document Type: Article

References (42)

1. S. Baluja and R. Caruana,"Removing the genetics from the standard genetic algorithm," in Proc. ML-95, 12th Int. Conf. Machine Learning. Palo Alto, CA: Morgan Kaufmann, 1995, pp. 38-46.
2. A. G. Barto, R. S. Sutton, and P. S. Brower,"Associative search network: A reinforcement learning associative memory," Biological Cybern., vol. 40, pp. 201-211, 1981.
3. R. Beckers, J. L. Deneubourg, and S. GOSS,"Trails and U-turns in the selection of the shortest path by the ant Lasius Niger," J. Theoretical Biology, vol. 159, pp. 397-415, 1992.
4. J. L. Bentley,"Fast algorithms for geometric traveling salesman problems," ORSA J. Comput., vol. 4, pp. 387-111, 1992.
5. H. Bersini, M. Dorigo, S. Langerman, G. Seront, and L. M. Gambardella,"Results of the first international contest on evolutionary optimization (1st ICEO)," in Proc. IEEE Int. Conf. Evolutionary Computation, IEEEEC 96, pp. 611-615.
6. H. Bersini, C. Oury, and M. Dorigo,"Hybridization of genetic algorithms," Université Libre de Bruxelles, Belgium, Tech. Rep. IRIDIA/9522, 1995.
7. A. Colorni, M. Dorigo, and V. Maniezzo,"Distributed optimization by ant colonies," in Proc. ECAL91-Eur. Conf. Artificial Life. New York: Elsevier, 1991, pp. 134-142.
8. _,"An investigation of some properties of an ant algorithm," in Proc. Parallel Problem Solving from Nature Conference (PPSN 92) New York: Elsevier, 1992, pp. 509-520.
9. J. L. Deneubourg,"Application de l'ordre par fluctuations àla description de certaines étapes de la construction du nid chez les termites," Insect Sociaux, vol. 24, pp. 117-130, 1977.
10. M. Dorigo,"Optimization, learning and natural algorithms," Ph.D. dissertation, DEI, Politecnico di Milano, Italy, 1992 (in Italian).
11. M. Dorigo and L. M. Gambardella,"A study of some properties of AntQ," in Proc. PPSN IV-4tth Int. Conf. Parallel Problem Solving from Nature. Berlin, Germany: Springer-Verlag, 1996, pp. 656-665.
12. M. Dorigo, V. Maniezzo, and A. Colorni,"The ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst, Man, Cybern. B, vol. 26, no. 2, pp. 29-41, 1996.
13. R. Durbin and D. Willshaw,"An analogue approach to the travelling salesman problem using an elastic net method," Nature, vol. 326, pp. 689-691, 1987.
14. S. Eilon, C. D. T. Watson-Gandy, and N. Christofides,"Distribution management: Mathematical modeling and practical analysis," Oper. Res. Quart., vol. 20, pp. 37-53, 1969.
15. D. B. Fogel,"Applying evolutionary programming to selected traveling salesman problems," Cybern. Syst: Int. J., vol. 24, pp. 27-36, 1993.
16. M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer,"Data structures for traveling salesmen," J. Algorithms, vol. 18, pp. 432-4179, 1995.
17. B. Freisieben and P. Merz,"Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," in Proc. IEEE Int. Conf. Evolutionary Computation, IEEE-EC 96, 1996, pp. 616-621.
18. _,"New genetic local search operators for the traveling salesman problem," in Proc. PPSN IV-4th Int. Conf. Parallel Problem Solving from Nature. Berlin, Germany: Springer-Verlag, 1996, pp. 890-899.
19. L. M. Gambardella and M. Dorigo,"Ant-Q: A reinforcement learning approach to the traveling salesman problem," in Proc. ML-95, I2th Int. Conf. Machine Learning. Palo Alto, CA: Morgan Kaufmann, 1995, pp. 252-260.
20. _,"Solving symmetric and asymmetric TSP's by ant colonies," P roc. IEEE Int. Conf. Evolutionary Computation, IEEE-EC 96, 1996, pp. 622-627.
21. B. Golden and W. Stewart,"Empiric analysis of heuristics," in The Traveling Salesman Problem, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan, and D. B. Shmoys, Eds. New York: Wiley, 1985.
22. S. GOSS, S. Aron, J. L. Deneubourg, and J. M. Pasteels,"Self-organized shortcuts in the argentine ant," Naturwissenschaften, vol. 76, pp. 579-581, 1989.
23. P. P. Grasse,"La reconstruction du nid et les coordinations interindividuelles chez Bellicositermes natalensis et Cubitermes sp. La théorie de la stigmergie: Essai d'interprétation des termites constructeurs," Insect Sociaux, vol. 6, pp. 41-83, 1959.
24. B. Hölldobler and E. O. Wilson, The Ants. Berlin: Springer-Verlag, 1990.
25. D. S. Johnson and L. A. McGeoch,"The travelling salesman problem: a case study in local optimization," in Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds. New York: Wiley: New York, 1997.
26. L. P. Kaelbling, L. M. Littman, and A. W. Moore,"Reinforcement learning: A survey," J. Artif. Intell. Res., vol. 4, pp. 237-285, 1996.
27. P.-C. Kanellakis and C. H. Papadimitriou,"Local search for the asymmetric traveling salesman problem," Oper. Res., vol. 28, no. 5, pp. 1087-1099, 1980.
28. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan, and D. B. Shmoys, Eds., The Traveling Salesman Problem. New York: Wiley, 1985.
29. F.-T. Lin, C.-Y. Kao, and C.-C. Hsu,"Applying the genetic approach to simulated annealing in solving some NP-Hard problems," IEEE Trans. Syst., Man, Cybern., vol. 23, pp. 1752-1767, 1993.
30. S. Lin.,"Computer solutions of the traveling salesman problem," Bell Syst. J., vol. 44, pp. 2245-2269, 1965.
31. S. Lin and B. W. Kernighan,"An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
32. V. Maniezzo, A. Colorni, and M. Dorigo,"The ant system applied to the quadratic assignment problem," Université Libre de Bruxelles, Belgium, Tech. Rep. IRIDIA/94-28, 1994.
33. O. Martin, S. W. Otto, and E. W. Feiten,"Large-step Markov chains for the TSP incorporating local search heuristics," Oper. Res. Lett., vol. 11, pp. 219-224, 1992.
34. J.-Y. Potvin,"The traveling salesman problem: A neural network perspective," ORSA J. Comput., vol. 5, no. 4, pp. 328-347, 1993.
35. G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications. New York: Springer-Verlag, 1994.
36. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis,"An analysis of several heuristics for the traveling salesman problem," SIAM J. Comput., vol. 6, pp. 563-581, 1977.
37. R. Schoonderwoerd, O. Holland, J. Brüten, and L. Rothkrantz,"Antbased load balancing in telecommunications networks," Adaptive Behavior, vol. 5, no. 2, 1997.
38. T. Stutzle and H. Hoos,"Improvements on the ant system, introducing the MAX-MIN ant system," in Proc. ICANNGA97-Third Int. Conf. Artificial Neural Networks and Genetic Algorithms. Wien, Germany: Springer-Verlag, 1997.
39. _,"The MAX-MIN ant system and local search for the traveling salesman problem," in Proc. ICEC'97-1997 IEEE 4th Int. Conf. Evolutionary Computation, 1997, pp. 309-314.
40. C. J. C. H. Watkins,"Learning with delayed rewards," Ph.D. dissertation, Psychology Dept., Univ. of Cambridge, UK, 1989.
41. D. Whitley, T. Starkweather, and D. Fuquay,"Scheduling problems and travelling salesman: the genetic edge recombination operator," in Proc. the 3rd Int. Conf. Genetic Algorithms. Palo Alto, CA: Morgan Kaufmann, 1989, pp. 133-140.
42. L. M. Gambardella, E. Taillard, and M. Dorigo,"Ant colonies for QAP," IDSIA, Lugano, Switzerland, Tech. Rep. IDSIA 97-4, 1997.