Runtime analysis of ant colony optimization on dynamic shortest path problems

DOI10.1016/J.TCS.2014.06.035MaRDI QIDQ477086zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

ant colony optimizationshortest pathsdynamic problemsruntime analysis

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 2013543 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• 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
• Analyzing evolutionary algorithms. The computer science perspective.
• Ant colony optimization and the minimum spanning tree problem
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Running time analysis of ant colony optimization for shortest path problems
• Simplified drift analysis for proving lower bounds in evolutionary computation

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
• Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
• scientific article; zbMATH DE number 2013445 (Why is no real title available?)
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification
• Running time analysis of ant colony optimization for shortest path problems
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• 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)