论文信息 - ACO and TSP - 字舞流文

ACO and TSP

Jean-Luc Ngassa | Jakob Kierkegaard

[1] Robert Sedgewick,et al. Algorithms in C , 1990 .

[2] Berthold Vöcking,et al. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[3] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[4] J. Deneubourg,et al. Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[5] Salah Zidi,et al. Ant Colony with Dynamic Local Search for the Time Scheduling of Transport Networks , 2006, Int. J. Comput. Commun. Control.

[6] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[7] Marco Dorigo,et al. Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[8] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..