An empirical study of hyperheuristics for managing very large sets of low level heuristics

S. Remde, P. Cowling, K. Dahal, N. Colledge, E. Selensky

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Hyperheuristics give us the appealing possibility of abstracting the solution method from the problem, since our hyperheuristic, at each decision point, chooses between different low level heuristics rather than different solutions as is usually the case for metaheuristics. By assembling low level heuristics from parameterised components we may create hundreds or thousands of low level heuristics, and there is increasing evidence that this is effective in dealing with every eventuality that may arise when solving different combinatorial optimisation problem instances since at each iteration the solution landscape is amenable to at least one of the low level heuristics. However, the large number of low level heuristics means that the hyperheuristic has to intelligently select the correct low level heuristic to use, to make best use of available CPU time. This paper empirically investigates several hyperheuristics designed for large collections of low level heuristics and adapts other hyperheuristics from the literature to cope with these large sets of low level heuristics on a difficult real-world workforce scheduling problem. In the process we empirically investigate a wide range of approaches for setting tabu tenure in hyperheuristic methods, for a complex real-world problem. The results show that the hyperheuristic methods described provide a good way to trade off CPU time and solution quality.
Original languageEnglish
Pages (from-to)392-405
JournalJournal of the Operational Research Society
Volume63
Issue number3
DOIs
Publication statusPublished - Mar 2012
Externally publishedYes

Keywords

  • computational analysis
  • heuristics
  • hyperheuristics
  • machine learning
  • optimisation
  • scheduling
  • tabu search

Cite this