Adaptive operator selection at the hyper-level

Authors:
Eduardo Krempser;Álvaro Fialho;Helio J. C. Barbosa
Affiliations:
Laboratório Nacional de Computação Científica, Petrópolis, Brazil;Nokia Institute of Technology (INdT), Manaus, Brazil;Laboratório Nacional de Computação Científica, Petrópolis, Brazil
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Year:
2012

Citing 8
Cited 0

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Finite-time Analysis of the Multiarmed Bandit Problem

Machine Learning
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
An adaptive pursuit strategy for allocating operator probabilities

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
Extreme Value Based Adaptive Operator Selection

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Toward comparison-based adaptive operator selection

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Whenever a new problem needs to be tackled, one needs to decide which of the many existing metaheuristics would be the most adequate one; but it is very difficult to know their performance a priori. And then, when a metaheuristic is chosen, there are still its parameters that need to be set by the user. This parameter setting is usually very problem-dependent, significantly affecting their performance. In this work we propose the use of an Adaptive Operator Selection (AOS) mechanism to automatically control, while solving the problem, (i) which metaheuristic to use for the generation of a new solution, (exemplified here by a Genetic Algorithm (GA) and a Differential Evolution (DE) scheme); and (ii) which corresponding operator should be used, (selecting among five operators available for the GA and four operators for DE). Two AOS schemes are considered: the Adaptive Pursuit and the Fitness Area Under Curve Multi-Armed Bandit. The resulting algorithm, named as Adaptive Hyper-Heuristic (HH), is evaluated on the BBOB noiseless testbed, showing superior performance when compared to (a) the same HH without adaptation, and also (b) the adaptive DE and GA.