Optimizing expected path lengths with ant colony optimization using fitness proportional update

DOI10.1145/2460239.2460246MaRDI QIDQ5276112zbMATH OpenOpenAlexFDO

Authors Matthias Feldmann, Timo Kötzing

Publication date 14 July 2017

Published in Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2460239.2460246

zbMATH Keywords

ant colony optimizationsingle-destination shortest pathstochastic problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A simple ant colony optimizer for stochastic shortest path problems
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• 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
• Ant Colony Optimization Algorithms for Shortest Path Problems

Cited in

(15)

• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions
• A simple ant colony optimizer for stochastic shortest path problems
• Running time analysis of the (1+1)-EA for robust linear optimization
• Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
• Analysis of noisy evolutionary optimization when sampling fails
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• Concentrated hitting times of randomized search heuristics with variable drift
• Robustness of populations in stochastic environments
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Lower bounds from fitness levels made easy
• Comma selection outperforms plus selection on OneMax with randomly planted optima
• Improved time complexity analysis of the simple genetic algorithm

This page was built for publication: Optimizing expected path lengths with ant colony optimization using fitness proportional update

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276112)