All Outputs (11)

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 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)
Conference Proceeding
Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2004). Analysing similarity in exam timetabling.

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.

Using simulated annealing to study behaviour of various exam timetabling data sets (2003)
Conference Proceeding
Burke, E., Eckersley, A., McCollum, B., Sanja, P., & Qu, R. (2003). Using simulated annealing to study behaviour of various exam timetabling data sets.

Similarity Measures for Exam Timetabling Problems (2003)
Conference Proceeding
Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2003). Similarity Measures for Exam Timetabling Problems.

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)
Conference Proceeding
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2002). Knowledge discovery in hyper-heuristic using case-based reasoning on course 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.

Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems (2002)
Book Chapter
Petrovic, S., & Qu, R. (2002). Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems. In Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies. IOS Press

This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given... Read More about Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems.

Case-based reasoning in course timetabling: an attribute graph approach (2001)
Conference Proceeding
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2001). Case-based reasoning in course timetabling: an attribute graph approach.

An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. Previous solved cases represented by attribute g... Read More about Case-based reasoning in course timetabling: an attribute graph approach.

Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems (2000)
Journal Article
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2000). Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems. Knowledge-Based Systems, 13(2-3),

In this paper, we present a case-based reasoning (CBR) approach solving educational time-tabling problems. Following the basic idea behind CBR, the solutions of previously solved problems are employed to aid finding the solutions for new problems. A... Read More about Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems.