A tight runtime analysis for the (μ + λ) EA
Denis Antipov, Benjamin Doerr, Jiefeng Fang, Tangi Hetet · Proceedings of the Genetic and Evolutionary Computation Conference · 2018
Despite significant progress in the theory of evolutionary algorithms, the theoretical understanding of true population-based evolutionary algorithms remains challenging and only few rigorous results exist. Already for the most basic problem, the determination of the asymptotic runtime of the (μ + λ) evolutionary algorithm on the simple OneMax benchmark function, only the special cases μ = 1 and λ = 1 have been solved.