Skip to main content

Research Repository

See what's under the surface

Advanced Search

Similarity Measures for Exam Timetabling Problems

Burke, Edmund; Eckersley, Adam; McCollum, Barry; Petrovic, Sanja; Qu, Rong

Authors

Edmund Burke

Adam Eckersley

Barry McCollum

Sanja Petrovic

Rong Qu



Abstract

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.

Publication Date Jan 1, 2003
APA6 Citation Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2003). Similarity Measures for Exam Timetabling Problems
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information

Files

rxqMISTA03.pdf (77 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;