Exponential slowdown for larger populations. The (+1)-EA on monotone functions

DOI10.1145/3299904.3340309MaRDI QIDQ5215482zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
• Population size versus runtime of a simple evolutionary algorithm
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax

Cited in

(8)

• Exponential upper bounds for the runtime of randomized search heuristics
• Fixed-target runtime analysis
• Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
• Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• A large population size can be unhelpful in evolutionary algorithms
• Do additional target points speed up evolutionary algorithms?

This page was built for publication: Exponential slowdown for larger populations. The \((\mu+1)\)-EA on monotone functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215482)