Runtime analysis of ant colony optimization on dynamic shortest path problems
From MaRDI portal
Publication:477086
DOI10.1016/J.TCS.2014.06.035zbMath1303.68122OpenAlexW2003694457WikidataQ57200583 ScholiaQ57200583MaRDI QIDQ477086
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
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Populations can be essential in tracking dynamic optima ⋮ Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems ⋮ More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem ⋮ Running time analysis of the (1+1)-EA for robust linear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Running time analysis of ant colony optimization for shortest path problems
- 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
- Ant colony optimization and the minimum spanning tree problem
- A simple ant colony optimizer for stochastic shortest path problems
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
This page was built for publication: Runtime analysis of ant colony optimization on dynamic shortest path problems
