In this paper, we prove polynomial running time bounds for two Ant Colony Optimization (ACO) algorithms for two problems, One-Max and the single-destination shortest paths problem on directed acyclic graphs. More specifically, we extend the recent result of Neumann and Witt on One-Max, to the case of multiple ants by showing that our multiple-ant algorithm runs in ) log ( nodes and m edges. We believe that this is the first running time analysis of an ACO-based algorithm on a practical problem. We also propose a new notion of convergence, called greedy convergence.
The first investigation of ACO for shortest path problems has been made by REF .
A Running Time Analysis for an Ant Colony Optimization Algorithm for Shortest Paths on Directed Acyclic Graphs
Inf. Process. Lett.
Inf. Process. Lett.
Mathematics Computer Science