Theoretical properties of two ACO approaches for the traveling salesman problem

Authors:
Timo Kötzing;Frank Neumann;Heiko Röglin;Carsten Witt
Affiliations:
Algorithms and Complexity, Max-Planck-Institut für Informatik, Saarbrücken, Germany;Algorithms and Complexity, Max-Planck-Institut für Informatik, Saarbrücken, Germany;Department of Quantitative Economics, Maastricht University, The Netherlands;DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark
Venue:
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Year:
2010

Citing 7
Cited 8

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

SIAM Journal on Computing
Ant Colony Optimization

Ant Colony Optimization
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Algorithmica
Running Time Analysis of ACO Systems for Shortest Path Problems

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Runtime analysis of an ant colony optimization algorithm for TSP instances

IEEE Transactions on Evolutionary Computation

Runtime analysis of the 1-ANT ant colony optimizer

Theoretical Computer Science
Using markov-chain mixing time estimates for the analysis of ant colony optimization

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Simple max-min ant systems and the optimization of linear pseudo-boolean functions

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Theory of swarm intelligence

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Running time analysis of Ant Colony Optimization for shortest path problems

Journal of Discrete Algorithms
The use of tail inequalities on the probable computational time of randomized search heuristics

Theoretical Computer Science
Local search and the traveling salesman problem: a feature-based characterization of problem hardness

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.