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.

[1]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[2]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[3]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[4]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[5]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[6]  Yuren Zhou,et al.  Runtime Analysis of an Ant Colony Optimization Algorithm for TSP Instances , 2009, IEEE Transactions on Evolutionary Computation.

[7]  Dirk Sudholt,et al.  Running Time Analysis of ACO Systems for Shortest Path Problems , 2009, SLS.

[8]  W. Gutjahr,et al.  Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement , 2008 .

[9]  Walter J. Gutjahr,et al.  Mathematical runtime analysis of ACO algorithms: survey on an emerging issue , 2007, Swarm Intelligence.

[10]  Kluwer Academic Publishers.  Methodology and computing in applied probability , 1999 .

[11]  Dirk Sudholt,et al.  Analysis of different MMAS ACO algorithms on unimodal functions and plateaus , 2009, Swarm Intelligence.

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  Berthold Vöcking,et al.  Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[14]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[15]  Frank Neumann,et al.  Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2006, ISAAC.

[16]  Dirk Sudholt,et al.  Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search , 2008, ANTS Conference.

[17]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[18]  Craig A. Tovey,et al.  New Results on the Old k-opt Algorithm for the Traveling Salesman Problem , 1999, SIAM J. Comput..

[19]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .