Skip to main content
Article thumbnail
Location of Repository

A graph-based hyper heuristic for timetabling problems

By Edmund Burke, Barry MacCloumn, Amnon Meisels, Sanja Petrovic and Rong Qu


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. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a multi-stage hyper-heuristic where the Tabu Search employs permutations upon a different number of graph heuristics in two stages. We study this graph-based hyper-heuristic approach 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 are compared with the fine-tuned bespoke state-of-the-art approaches. The results are within the range of the best results reported in the literature. The approach described here represents a significantly more generally applicable approach than the current state of the art in the literature. Future work will extend this hyper-heuristic framework by employing methodologies which are applicable on a wider range of timetabling and scheduling problems

Publisher: Elsevier
Year: 2007
OAI identifier:
Provided by: Nottingham ePrints

Suggested articles


  1. (1998). A Heuristic Incremental Modelling Approach to Course Timetabling.
  2. (1996). A Memetic Algorithm for University Exam Timetabling.
  3. (2006). A Multi-Stage Evolutionary Algorithm for the Timetabling Problem.
  4. (2003). A Tabu Search Hyperheuristic for Timetabling and Rostering. doi
  5. (2004). A Time-Predefined Local Search Approach to Exam Timetabling Problems.
  6. (2004). Applications to Timetabling,
  7. (1997). Automated Timetabling: the State of the Art.
  8. (2006). Case Based Heuristic Selection for Timetabling Problems. doi
  9. (2001). Case-based Reasoning in Course Timetabling: An Attribute Graph Approach. In: doi
  10. (1996). Computer-Aided School and University Timetabling: The New Wave. In:
  11. (2005). Determining feature weights using a genetic algorithm in a casebased reasoning approach to personnel rostering. Accepted for publication in
  12. (2002). Enhancing Timetable Solutions with Local Search Methods. In:
  13. (2004). Fuzzy Multiple Ordering Criteria for Examination Timetabling. In:
  14. (2006). Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems.
  15. (1998). Initialization Strategies and Diversity in Evolutionary Timetabling. doi
  16. (2004). Investigating Ahuja-Orlin's Large Neighbourhood Search for Examination Timetabling.
  17. (2003). Knowledge Discovery in Hyper-heuristic Using Case-Based Reasoning on Course Timetabling. In: doi
  18. (2005). Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling. To appear in:
  19. (2005). Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems. doi
  20. (1979). New Methods to Color the Vertices of a Graph.
  21. (2002). Recent Research Directions in Automated Timetabling. doi
  22. (2000). Structured Cases in Case-Based Reasoning -Re-using and Adapting Cases for Time-tabling Problems. Knowledge-Based Systems, doi
  23. (2004). The State of the Art of Nurse Rostering.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.