A Tabu-Search Hyperheuristic for Timetabling and Rostering

  • Authors:

  • E. K. Burke;G. Kendall;E. Soubeiga

  • Affiliations:

  • School of Computer Science & IT, University of Nottingham, Nottingham NG8 1BB, UK. ekb@cs.nott.ac.uk;School of Computer Science & IT, University of Nottingham, Nottingham NG8 1BB, UK. gxk@cs.nott.ac.uk;School of Computer Science & IT, University of Nottingham, Nottingham NG8 1BB, UK. exs@cs.nott.ac.uk

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.