A graph-based hyper heuristic for timetabling problems Academic Article uri icon

abstract

  • This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. A Tabu Search approach is employed within the hyper-heuristic framework that searches for different permutations of graph heuristics for solving both exam and course timetabling problems. A multi-stage hyperheuristic is then developed where the Tabu Search approach employs permutations upon a different number of heuristics in 2 stages. We study the graph- based hyper heuristic approaches within the context of exploring fundamental issues concerning the search space of the hyper-heuristic (the heuristic space) and the solution space. Such issues have not been addressed in other hyper-heuristic research. These approaches are tested on both exam and course benchmark timetabling problems and …

publication date

  • January 1, 2004