Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

DOI10.1145/1967654.1967665zbMath1369.68303OpenAlexW2053482941MaRDI QIDQ5276091

Benjamin Doerr, Daniel Johannsen, Martin Schmidt

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.1967665

zbMATH Keywords

evolutionary algorithmdrift analysisruntime analysis

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 (1)

Static and self-adjusting mutation strengths for multi-valued decision variables

This page was built for publication: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets