Running Time Analysis of ACO Systems for Shortest Path Problems

  • Authors:

  • Christian Horoba;Dirk Sudholt

  • Affiliations:

  • LS 2, Fakultät für Informatik, Technische Universität Dortmund, Dortmund, Germany;LS 2, Fakultät für Informatik, Technische Universität Dortmund, Dortmund, Germany and International Computer Science Institute, Berkeley, USA

  • Venue:
  • SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO systems for shortest path problems. First, we improve running time bounds by Attiratanasunthron and Fakcharoenphol [Information Processing Letters , 105(3):88---92, 2008] for single-destination shortest paths and extend their results for acyclic graphs to arbitrary graphs. Our upper bound is asymptotically tight for large evaporation factors, holds with high probability, and transfers to the all-pairs shortest paths problem. There, a simple mechanism for exchanging information between ants with different destinations yields a significant improvement. Our results indicate that ACO is the best known metaheuristic for the all-pairs shortest paths problem.