Self-adjusting mutation rates with provably optimal success rules
Authors:
Open Access
- 13 July 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1479-1487
Abstract
No abstract availableAll Related Versions
Funding Information
- Paris Ile-de-France Region (Online Configuration of Heuristic Optimization Algorithms)
- Agence Nationale de la Recherche (ANR-11-LABX-0056-LMH)
This publication has 19 references indexed in Scilit:
- Self-adjusting mutation rates with provably optimal success rules2019
- Runtime analysis for self-adaptive mutation rates2018
- Simple on-the-fly parameter selection mechanisms for two classical discrete black-box optimization benchmark problems2018
- On the runtime analysis of selection hyper-heuristics with adaptive learning periods2018
- Optimal Static and Self-Adjusting Parameter Choices for the $(1+(\lambda ,\lambda ))$ ( 1 + ( λ , λ ) ) Genetic AlgorithmAlgorithmica, 2017
- A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary AlgorithmsACM Computing Surveys, 2016
- From black-box complexity to designing new genetic algorithmsTheoretical Computer Science, 2015
- Multiplicative Drift AnalysisAlgorithmica, 2012
- Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed2009
- Adaptive operator selection with dynamic multi-armed bandits2008