Runtime analysis of ant colony optimization on dynamic shortest path problems
DOI10.1016/J.TCS.2014.06.035zbMATH Open1303.68122OpenAlexW2003694457WikidataQ57200583 ScholiaQ57200583MaRDI QIDQ477086FDOQ477086
Authors: Andrei Lissovoi, Carsten Witt 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.035
Recommendations
- Running time analysis of ant colony optimization for shortest path problems
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- On the finite-time dynamics of ant colony optimization
- First steps to the runtime complexity analysis of ant colony optimization
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- A simple ant colony optimizer for stochastic shortest path problems
- Running time analysis of ant colony optimization for shortest path problems
- Title not available (Why is that?)
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Simplified drift analysis for proving lower bounds in evolutionary computation
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- Ant colony optimization and the minimum spanning tree problem
Cited In (14)
- Ant Colony Optimization Algorithms for Shortest Path Problems
- Running time analysis of the (1+1)-EA for robust linear optimization
- Populations can be essential in tracking dynamic optima
- Title not available (Why is that?)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Ant Lion Optimized Lexicographic Model for Shortest Path Identification
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
- Running time analysis of ant colony optimization for shortest path problems
- More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- A simple ant colony optimizer for stochastic shortest path problems
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
This page was built for publication: Runtime analysis of ant colony optimization on dynamic shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477086)
