On the runtime analysis of selection hyper-heuristics with adaptive learning periods
Open Access
- 2 July 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1015-1022
Abstract
No abstract availableKeywords
Funding Information
- Fondation Mathématique Jacques Hadamard (ANR-11-LABX-0056-LMH)
- Engineering and Physical Sciences Research Council (EP/M004252/1)
This publication has 21 references indexed in Scilit:
- From black-box complexity to designing new genetic algorithmsTheoretical Computer Science, 2015
- (1+1) EA on Generalized Dynamic OneMax2015
- Analyzing Randomized Search Heuristics: Tools from Probability Theory2011
- A Classification of Hyper-heuristic Approaches2010
- A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination TimetablingInternational Journal of Applied Metaheuristic Computing, 2010
- Learning probability distributions in continuous evolutionary algorithms – a comparative reviewNatural Computing, 2004
- Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation2002
- A Hyperheuristic Approach to Scheduling a Sales Summit2001
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963