Sciweavers

Share
ANTSW
2010
Springer

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

8 years 4 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
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.
Timo Kötzing, Frank Neumann, Heiko Rögli
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where ANTSW
Authors Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
Comments (0)
books