论文信息 - Solving symmetric and asymmetric TSPs by ant colonies

Solving symmetric and asymmetric TSPs by ant colonies

We present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymmetric traveling salesman problems. Results show that ACS is able to find good solutions to these problems.

Luca Maria Gambardella | Marco Dorigo | M. Dorigo | L. Gambardella

[1] Ben J. A. Kröse,et al. Learning from delayed rewards , 1995, Robotics Auton. Syst..

[2] DorigoM.,et al. Ant colony system , 1997 .

[3] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .

[4] Marco Dorigo,et al. Ant system for Job-shop Scheduling , 1994 .

[5] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .

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

[7] Luca Maria Gambardella,et al. Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[8] Marco Dorigo,et al. An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[9] J. Deneubourg,et al. Probabilistic behaviour in ants: A strategy of errors? , 1983 .

[10] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.