Skip to main content
SpringerLink
Log in

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

  • Conference paper
Book cover Swarm Intelligence (ANTS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6234))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambrigde (2004)

    MATH  Google Scholar 

  3. Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Berlin (2007)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  Google Scholar 

  9. Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. Algorithmica 54(2), 243–255 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  11. Zhou, Y.: Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation 13(5), 1083–1092 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Algorithms and Complexity, Saarbrücken, Germany

    Timo Kötzing & Frank Neumann

  2. Department of Quantitative Economics, Maastricht University, The Netherlands

    Heiko Röglin

  3. DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark

    Carsten Witt

Authors
  1. Timo Kötzing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heiko Röglin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carsten Witt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium

    Marco Dorigo

  2. IRIDIA, CoDE, Université Libre de Bruxelles, Av. F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Mauro Birattari

  3. ’Dalla Molle’ Institute for Artificial Intelligence (IDSIA), Galleria 2, 6928, Manno-Lugano, Switzerland

    Gianni A. Di Caro

  4. Complex Systems Institute, Paris-Ile-de-France, CREA, Ecole Polytechnique & CNRS, 57-59, rue Lhomond, 75005, Paris, France

    René Doursat

  5. Department of Computer Science, University of Pretoria, 0002, P.O. Box, Pretoria, South Africa

    Andries P. Engelbrecht

  6. EPFL, Laboratory of Intelligent Systems, Lausanne, Switzerland

    Dario Floreano

  7. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Lugano, Switzerland

    Luca Maria Gambardella

  8. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

  9. KOVAN Research Lab., Department of Computer Engineering, Middle East Technical University, Inonu Bulvari, 06531, Ankara, Turkey

    Erol Şahin

  10. Department of Bioengineering, Binghamton University, State University of New York, 13902-6000, Binghamton NY, USA

    Hiroki Sayama

  11. IRIDIA, CoDE, Université Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Thomas Stützle

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15461-4_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15460-7

  • Online ISBN: 978-3-642-15461-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation