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

DOI10.1145/1967654.1967667zbMath1369.68331OpenAlexW2112897495MaRDI QIDQ5276093

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

Markov chain Monte Carlomixing timecouplingant colony optimizationshortest path problemspseudo-Boolean optimization

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?

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