Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function

DOI10.1007/978-3-030-72904-2_6zbMath1474.68474arXiv2010.13428OpenAlexW3148316163MaRDI QIDQ2233519

Simone Riedi, Johannes Lengler

Publication date: 18 October 2021

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

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

Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions, OneMax is not the easiest function for fitness improvements, Two-dimensional drift analysis: optimizing two functions simultaneously can be hard, More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments, Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter

Cites Work

• MMAS versus population-based EA on a family of dynamic fitness functions
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• The impact of a sparse migration topology on the runtime of island models in dynamic optimization
• Adaptive drift analysis
• Multiplicative drift analysis
• Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem
• A runtime analysis of parallel evolutionary algorithms in dynamic optimization
• (1+1) EA on Generalized Dynamic OneMax
• Drift Analysis and Evolutionary Algorithms Revisited
• Exponential slowdown for larger populations
• On the Brittleness of Evolutionary Algorithms