Chapter

Swarm Intelligence

Volume 6234 of the series Lecture Notes in Computer Science pp 324-335

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

  • Timo KötzingAffiliated withMax-Planck-Institut für Informatik, Algorithms and Complexity
  • , Frank NeumannAffiliated withMax-Planck-Institut für Informatik, Algorithms and Complexity
  • , Heiko RöglinAffiliated withDepartment of Quantitative Economics, Maastricht University
  • , Carsten WittAffiliated withDTU Informatics, Technical University of Denmark

* Final gross prices may vary according to local VAT.

Get Access

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.