A. Aleti and I. Moser, A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms, Comput. Surveys, vol.49, p.35, 2016.

A. Auger, Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed, Companion Material for Proc. of Genetic and Evolutionary Computation Conference (GECCO'09), pp.2447-2452, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00430515

S. Böttcher, B. Doerr, and F. Neumann, Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem, Proc. of Parallel Problem Solving from Nature (PPSN'10), vol.6238, pp.1-10, 2010.

E. Carvalho-pinto and C. Doerr, Discussion of a More Practice-Aware Runtime Analysis for Evolutionary Algorithms, Proc. of Artificial Evolution (EA'17, pp.298-305, 2017.

E. Carvalho-pinto and C. Doerr, A Simple Proof for the Usefulness of Crossover in Black-Box Optimization, Proc. of Parallel Problem Solving from Nature (PPSN'18), vol.11102, pp.29-41, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01921063

Á. Luís-da-costa, M. Fialho, M. Schoenauer, and . Sebag, Adaptive operator selection with dynamic multi-armed bandits, Proc. of Genetic and Evolutionary Computation Conference (GECCO'08), pp.913-920, 2008.

L. Devroye, The compound random search, 1972.

B. Doerr, Better Runtime Guarantees via Stochastic Domination, Proc. of Evolutionary Computation in Combinatorial Optimization (EvoCOP'18), vol.10782, pp.1-17, 2018.

B. Doerr and C. Doerr, Optimal Static and Self-Adjusting Parameter Choices for the (1 + (?, ?)) Genetic Algorithm, Algorithmica, vol.80, pp.1658-1709, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01668262

B. Doerr and C. Doerr, Theory of Parameter Control Mechanisms for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices, Theory of Randomized Search Heuristics in Discrete Search Spaces, 2018.

B. Doerr, C. Doerr, and F. Ebel, From black-box complexity to designing new genetic algorithms, Theoretical Computer Science, vol.567, pp.87-104, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01272858

B. Doerr, C. Doerr, and J. Lengler, Self-Adjusting Mutation Rates with Provably Optimal Success Rules, A GitHub repository with numerical evaluations is available at, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02175768

B. Doerr, C. Doerr, and J. Yang, 2016. k -Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation, Proc. of Parallel Problem Solving from Nature (PPSN'16), vol.9921
URL : https://hal.archives-ouvertes.fr/hal-01605625

. Springer, , pp.824-834

B. Doerr, D. Johannsen, and C. Winzen, Multiplicative Drift Analysis, Algorithmica, vol.64, pp.673-697, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01797908

B. Doerr, A. Lissovoi, P. S. Oliveto, and J. A. Warwicker, On the Runtime Analysis of Selection Hyper-Heuristics with Adaptive Learning Periods, Proc. of Genetic and Evolutionary Computation Conference (GECCO'18), pp.1015-1022, 2018.

B. Doerr, C. Witt, and J. Yang, Runtime Analysis for Selfadaptive Mutation Rates, Proc. of Genetic and Evolutionary Computation Conference (GECCO'18), pp.1475-1482, 2018.

C. Doerr and M. Wagner, On the Effectiveness of Simple Success-Based Parameter Selection Mechanisms for Two Classical Discrete Black-Box Optimization Benchmark Problems, Proc. of Genetic and Evolutionary Computation Conference (GECCO'18), pp.943-950, 2018.

Á. Fialho, L. Costa, M. Schoenauer, and M. Sebag, Analyzing bandit-based adaptive operator selection mechanisms, Annals of Mathematics and Artificial Intelligence, vol.60, pp.25-64, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00519579

T. Jansen, K. A. Jong, and I. Wegener, On the Choice of the Offspring Population Size in Evolutionary Algorithms, Evolutionary Computation, vol.13, pp.413-440, 2005.

G. Karafotias, Á. E. Eiben, and M. Hoogendoorn, Generic parameter control with reinforcement learning, Proc. of Genetic and Evolutionary Computation Conference (GECCO'14), pp.1319-1326, 2014.

G. Karafotias, M. Hoogendoorn, and A. E. Eiben, Parameter Control in Evolutionary Algorithms: Trends and Challenges, IEEE Transactions on Evolutionary Computation, vol.19, pp.167-187, 2015.

S. Kern, S. D. Müller, N. Hansen, D. Büche, J. Ocenasek et al., Learning probability distributions in continuous evolutionary algorithms -a comparative review, Natural Computing, vol.3, pp.77-112, 2004.

J. Lässig and D. Sudholt, General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms, Evolutionary Computation, vol.22, pp.405-437, 2014.

A. Lissovoi, P. S. Oliveto, and J. A. Warwicker, On the Runtime Analysis of Generalised Selection Hyper-heuristics for Pseudo-Boolean Optimisation, Proc. of Genetic and Evolutionary Computation Conference (GECCO'17), 2017.

, Ingo Rechenberg. 1973. Evolutionsstrategie. Friedrich Fromman Verlag (Günther Holzboog KG)

A. Michael, K. Schumer, and . Steiglitz, Adaptive step size random search, IEEE Trans. Automat. Control, vol.13, pp.270-276, 1968.

D. Sudholt, Crossover speeds up building-block assembly, Proc. of Genetic and Evolutionary Computation Conference (GECCO'12), pp.689-702, 2012.

I. Wegener, Theoretical Aspects of Evolutionary Algorithms, Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science), vol.2076, pp.64-78, 2001.