Do additional optima speed up evolutionary algorithms?

DOI10.1145/3450218.3477309MaRDI QIDQ5075418zbMATH OpenOpenAlexFDO

Authors Jakob Bossek, Dirk Sudholt

Publication date 16 May 2022

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

Full work available at URL https://doi.org/10.1145/3450218.3477309

Mathematics Subject Classification ID

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

Recommendations

• Do additional target points speed up evolutionary algorithms?
• When do optimisation arguments make evolutionary sense?
• When do evolutionary algorithms optimize separable functions in parallel?
• Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation
• Convergence speed of evolutionary algorithm
• scientific article; zbMATH DE number 2013534
• Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.

Cited in

(3)

• Do additional target points speed up evolutionary algorithms?
• Runtime analysis of \((1+1)\) evolutionary algorithm controlled with Q-learning using greedy exploration strategy on \textsc{OneMax+ZeroMax} problem
• Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter

This page was built for publication: Do additional optima speed up evolutionary algorithms?

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