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

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. 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: oai:eprints.nottingham.ac.uk:371
Provided by: Nottingham ePrints

Suggested articles

Citations

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

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