Using Markov-chain mixing time estimates for the analysis of ant colony optimization

DOI10.1145/1967654.1967667MaRDI QIDQ5276093zbMATH OpenOpenAlexFDO

Authors Dirk Sudholt

Publication date 14 July 2017

Published in Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

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

zbMATH Keywords

ant colony optimizationcouplingMarkov chain Monte Carlomixing timepseudo-Boolean optimizationshortest path problems

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Ant colony optimization: recent developments in theoretical analysis
• scientific article; zbMATH DE number 1301966
• On the finite-time dynamics of ant colony optimization
• First steps to the runtime complexity analysis of ant colony optimization
• Running time analysis of ant colony optimization for shortest path problems

Cited in

(7)

• On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
• Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions
• A simple ant colony optimizer for stochastic shortest path problems
• A runtime analysis of parallel evolutionary algorithms in dynamic optimization
• MMAS versus population-based EA on a family of dynamic fitness functions
• Running time analysis of ant colony optimization for shortest path problems
• Ant-Inspired Density Estimation via Random Walks

This page was built for publication: Using Markov-chain mixing time estimates for the analysis of ant colony optimization

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