An exponential lower bound for the runtime of the compact genetic algorithm on jump functions

DOI10.1145/3299904.3340304zbMath1433.68643arXiv1904.08415OpenAlexW3101428723MaRDI QIDQ5215477

Benjamin Doerr

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.08415

zbMATH Keywords

evolutionary algorithmsruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Related Items (3)

Does comma selection help to cope with local optima? ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys ⋮ The runtime of the compact genetic algorithm on jump functions

This page was built for publication: An exponential lower bound for the runtime of the compact genetic algorithm on jump functions