Skip to main content
Article thumbnail
Location of Repository

Similarity Measures for Exam Timetabling Problems

By Edmund Burke, Adam Eckersley, Barry McCollum, Sanja Petrovic and Rong Qu


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 or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabling problem, will produce results which are comparative to those of a specially designed heuristic for that problem. We are investigating a Case based reasoning (CBR) technique to select from a set of algorithms which have been applied successfully to similar problem instances in the past. The assumption in CBR is that similar problems have similar solutions. For our system, the assumption is that an algorithm used to find a good solution to one problem will also produce a good result for a similar problem. The key to the success of the system will be our definition of similarity between two exam timetabling problems. The study will be carried out by running a series of tests using a simple Simulated Annealing Algorithm on a range of problems with differing levels of similarity and examining the data sets in detail. In this paper an initial investigation of the key factors which will be involved in this measure is presented with a discussion of how the definition of good impacts on this

Year: 2003
OAI identifier:
Provided by: Nottingham ePrints

Suggested articles


  1. A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling.
  2. (1995). CABINS: a framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. doi
  3. Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach.
  4. (1996). Case-based reasoning in scheduling. In
  5. Case-Based Reasoning. doi
  6. Examination Timetabling in British Universities - A Survey, in [7],
  7. (1996). Examination timetabling: Algorithmic strategies and applications. doi
  8. Recent Developments in Practical Examination Timetabling In [7],
  9. (2002). Recent Research Directions in Automated Timetabling.
  10. Scheduling, timetabling and rostering - A special relationship?.
  11. (2000). Structured cases in case-based reasoning - re-using and adapting cases for time-tabling problems.
  12. (2001). The Practice and Theory of Automated Timetabling III,
  13. The Theory and Practice of Simulated Annealing.

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