English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

MPS-Authors
/persons/resource/persons44814

Kötzing,  Timo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45115

Neumann,  Frank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Kötzing, T., Neumann, F., Röglin, H., & Witt, C. (2010). Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. In M. Dorigo, M. Birattari, G. A. Di Caro, R. Doursat, A. P. Engelbrecht, D. Floreano, et al. (Eds.), Swarm Intelligence (pp. 324-335). Berlin: Springer. doi:10.1007/978-3-642-15461-4_28.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1709-0
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 problem (TSP). We present a new construction graph and show that it has a stronger local property than one commonly used for constructing solutions of the TSP. Our rigorous runtime analyses for two ACO algorithms, based on these two construction procedures, show that they achieve a good approximation in expected polynomial time on random instances. Furthermore, we point out in which situations our algorithms get trapped in local optima and show where the use of the right amount of heuristic information is provably beneficial.