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

DOI10.1145/2460239.2460246zbMath1369.68307OpenAlexW1985115934MaRDI QIDQ5276112

Timo Kötzing, Matthias Feldmann

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 optimizationstochastic problemsingle-destination shortest path

Mathematics Subject Classification ID

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

Related Items (12)

Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Robustness of populations in stochastic environments ⋮ 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 ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ Improved time complexity analysis of the simple genetic algorithm ⋮ Lower bounds from fitness levels made easy ⋮ 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 ⋮ Runtime analysis of ant colony optimization on dynamic shortest path problems ⋮ Running time analysis of the (1+1)-EA for robust linear optimization

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