Theoretical properties of two ACO approaches for the traveling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6234 LNCS, Issue , 2010, Pages 324-335

  Kötzing, Timo ^a   Neumann, Frank ^a   Röglin, Heiko ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ACO ALGORITHMS; ANT-COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; INPUT GRAPHS; LOCAL PROPERTY; NEW CONSTRUCTIONS; POLYNOMIAL-TIME; RANDOM INSTANCE; RUNTIME BEHAVIORS;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; CELLULAR AUTOMATA; COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION;

TRAVELING SALESMAN PROBLEM;

EID: 78049288201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15461-4_28     Document Type: Conference Paper

References (11)

1. Chandra, B., Karloff, H. J., Tovey, C. A.: New results on the old k-Opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998-2029 (1999) (Pubitemid 30530989)
2. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambrigde (2004)
3. Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Berlin (2007)
4. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the tsp: extended abstract. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 1295-1304. SIAM, Philadelphia (2007)
5. Gutjahr, W. J., Sebastiani, G.: Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability 10, 409-433 (2008)
6. Horoba, C., Sudholt, D.: Running time analysis of ACO systems for shortest path problems. In: Stützle, T., Birattari, M., Hoos, H. H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 76-91. Springer, Heidelberg (2009)
7. Johnson, D. S., McGeoch, L. A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E. H. L., Lenstra, J. K. (eds.) Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
8. Neumann, F., Sudholt, D., Witt, C.: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3(1), 35-68 (2009)
9. Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. Algorithmica 54(2), 243-255 (2009)
10. Spielman, D. A., Teng, S. H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385-463 (2004)
11. Zhou, Y.: Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation 13(5), 1083-1092 (2009)