@inproceedings{22d551fbe4214a9e9d87444c2b51bb2a,
title = "Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations",
abstract = "We analyze the runtime of the (1 + λ) evolutionary algorithm (EA) on the classic royal road test function class. For a royal road function defined on bit-strings of length n having block size d ≥ log n + (c + 1 + ε) log d, we prove that the (1 + λ) EA with λ = Θ(nc) finds the optimum in an expected number of equation generations. Together with our lower bound of equation, this shows that for royal road functions even very large offspring populations do not reduce the runtime significantly.",
author = "Benjamin Doerr and Marvin Kunnemann",
year = "2013",
month = aug,
day = "21",
doi = "10.1109/CEC.2013.6557600",
language = "English",
isbn = "9781479904549",
series = "2013 IEEE Congress on Evolutionary Computation, CEC 2013",
pages = "424--431",
booktitle = "2013 IEEE Congress on Evolutionary Computation, CEC 2013",
note = "2013 IEEE Congress on Evolutionary Computation, CEC 2013 ; Conference date: 20-06-2013 Through 23-06-2013",
}