Simple max-min ant systems and the optimization of linear pseudo-boolean functions
From MaRDI portal
Publication:5276101
DOI10.1145/1967654.1967673zbMath1369.68314arXiv1007.4707OpenAlexW2131004531MaRDI QIDQ5276101
Timo Kötzing, Dirk Sudholt, Frank Neumann, Markus Wagner
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://arxiv.org/abs/1007.4707
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Runtime analysis of non-elitist populations: from classical optimisation to partial information ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions ⋮ Working principles of binary differential evolution
This page was built for publication: Simple max-min ant systems and the optimization of linear pseudo-boolean functions
