Exponential slowdown for larger populations

DOI10.1145/3299904.3340309zbMath1433.68647OpenAlexW3104223153MaRDI QIDQ5215482

Johannes Lengler, Xun Zou

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://doi.org/10.1145/3299904.3340309

zbMATH Keywords

populationevolutionary algorithmmonotone functionsruntime analysismutation ratehottopic functions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Fixed-target runtime analysis ⋮ Do additional target points speed up evolutionary algorithms? ⋮ On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function

This page was built for publication: Exponential slowdown for larger populations