Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
Future Generation Computer Systems
Introduction to Algorithms
Modeling the dynamics of ant colony optimization
Evolutionary Computation
Ant Colony Optimization
A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
Probability in the Engineering and Informational Sciences
Crossover is provably essential for the Ising model on trees
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The one-dimensional Ising model: mutation versus recombination
Theoretical Computer Science
Ant colony optimization theory: a survey
Theoretical Computer Science
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Theory of Computing Systems
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Information Processing Letters
First steps to the runtime complexity analysis of ant colony optimization
Computers and Operations Research
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Improved analysis methods for crossover-based algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
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
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
A few ants are enough: ACO with iteration-best update
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Edge-based representation beats vertex-based representation in shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization for stochastic shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theoretical properties of two ACO approaches for the traveling salesman problem
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
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
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Crossover speeds up building-block assembly
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Runtime analysis of ant colony optimization on dynamic shortest path problems
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Ant Colony Optimization (ACO) is a modern and very popular optimization paradigm inspired by the ability of ant colonies to find shortest paths between their nest and a food source. Despite its popularity, the theory of ACO is still in its infancy and a solid theoretical foundation is needed. We present bounds on the running time of different ACO systems for shortest path problems. First, we improve previous results by Attiratanasunthron and Fakcharoenphol [Information Processing Letters 105 (3) (2008) 88-92] for single-destination shortest paths and extend their results from DAGs to arbitrary directed 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. A comparison with evolutionary and genetic approaches indicates that ACO is among the best known metaheuristics for the all-pairs shortest paths problem.