Article | A methodology for determining an effective subset of heuristics in selection hyper-heuristics

Article

A methodology for determining an effective subset of heuristics in selection hyper-heuristics

Details

Citation

Soria-Alcaraz JA, Ochoa G, Sotelo-Figeroa M & Burke EK (2017) A methodology for determining an effective subset of heuristics in selection hyper-heuristics. European Journal of Operational Research, 260 (3), pp. 972-983. https://doi.org/10.1016/j.ejor.2017.01.042

Abstract
We address the important step of determining an effective subset of heuristics in selection hyper-heuristics. Little attention has been devoted to this in the literature, and the decision is left at the discretion of the investigator. The performance of a hyper-heuristic depends on the quality and size of the heuristic pool. Using more than one heuristic is generally advantageous, however, an unnecessary large pool can decrease the performance of adaptive approaches. Our goal is to bring methodological rigour to this step. The proposed methodology uses non-parametric statistics and fitness landscape measurements from an available set of heuristics and benchmark instances, in order to produce a compact subset of effective heuristics for the underlying problem. We also propose a new iterated local search hyper-heuristic usingmulti-armed banditscoupled with a change detection mechanism. The methodology is tested on two real-world optimisation problems: course timetabling and vehicle routing. The proposed hyper-heuristic with a compact heuristic pool, outperforms state-of-the-art hyper-heuristics and competes with problem-specific methods in course timetabling, even producing new best-known solutions in 5 out of the 24 studied instances.

Keywords
Metaheuristics; Hyper-heuristics; Adaptive Search; Combinatorial optimisation; Iterated Local Search

Journal
European Journal of Operational Research: Volume 260, Issue 3