Skip to main content

Research Repository

Advanced Search

Outputs (104)

A graph-based hyper heuristic for timetabling problems (2007)
Journal Article
Burke, E., MacCloumn, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph-based hyper heuristic for timetabling problems. European Journal of Operational Research, 176(1), https://doi.org/10.1016/j.ejor.2005.08.012

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... Read More about A graph-based hyper heuristic for timetabling problems.

Case Based Heuristic Selection for Timetabling Problems (2006)
Journal Article
Burke, E., Petrovic, S., & Qu, R. (2006). Case Based Heuristic Selection for Timetabling Problems. Journal of Scheduling, 9(2),

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than... Read More about Case Based Heuristic Selection for Timetabling Problems.

Multiple-retrieval case-based reasoning for course timetabling problems (2006)
Journal Article
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2006). Multiple-retrieval case-based reasoning for course timetabling problems. Journal of the Operational Research Society, 57(2),

The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the r... Read More about Multiple-retrieval case-based reasoning for course timetabling problems.

Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems (2005)
Presentation / Conference Contribution
Qu, R., & Burke, E. (2005, August). Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems. Paper presented at The Sixth Metaheuristics International Conference 2005, Vienna, Austria

This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solu... Read More about Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems.

A Decomposition, Construction and Post-Processing Approach for Nurse Rostering (2005)
Presentation / Conference Contribution
Brucker, P., Qu, R., Burke, E., & Post, G. A Decomposition, Construction and Post-Processing Approach for Nurse Rostering. Presented at Multidisciplinary International Conference on Scheduling : Theory and Applications

This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to t... Read More about A Decomposition, Construction and Post-Processing Approach for Nurse Rostering.

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems (2005)
Book Chapter
Burke, E., Dror, M., Petrovic, S., & Qu, R. (2005). Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The Next Wave in Computing, Optimization, and Decision Technologies. Springer

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which inte... Read More about Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems.

Analysing similarity in exam timetabling (2004)
Presentation / Conference Contribution
Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2004, August). Analysing similarity in exam timetabling. Presented at International Conference on the Practice and Theory of Automated Timetabling 2004

In this paper we carry out an investigation of some of the major features of exam timetabling problems with a view to developing a similarity measure. This similarity measure will be used within a case-based reasoning (CBR) system to match a new prob... Read More about Analysing similarity in exam timetabling.

Similarity Measures for Exam Timetabling Problems (2003)
Presentation / Conference Contribution
Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. Similarity Measures for Exam Timetabling Problems. Presented at Multidisciplinary International Conference on Scheduling : Theory and Applications

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance o... Read More about Similarity Measures for Exam Timetabling Problems.

Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling (2002)
Presentation / Conference Contribution
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling. Presented at International Conference on the Practice and Theory of Automated Timetabling

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics tha... Read More about Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling.