Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

  • Timo Kötzing
  • Frank Neumann
  • Heiko Röglin
  • Carsten Witt
Conference paper

DOI: 10.1007/978-3-642-15461-4_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)
Cite this paper as:
Kötzing T., Neumann F., Röglin H., Witt C. (2010) Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. In: Dorigo M. et al. (eds) Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg

Abstract

Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime behavior for the traveling salesperson (TSP) problem. We present a new construction graph and show that it has a stronger local property than the given input graph which is often used for constructing solutions. Later on, we investigate ACO algorithms for both construction graphs on random instances and show that they achieve a good approximation in expected polynomial time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Timo Kötzing
    • 1
  • Frank Neumann
    • 1
  • Heiko Röglin
    • 2
  • Carsten Witt
    • 3
  1. 1.Max-Planck-Institut für InformatikAlgorithms and ComplexitySaarbrückenGermany
  2. 2.Department of Quantitative EconomicsMaastricht UniversityThe Netherlands
  3. 3.DTU InformaticsTechnical University of DenmarkKgs. LyngbyDenmark

Personalised recommendations