Novel Local-Search-Based Approaches to University Examination Timetabling

Examination timetabling assigns examinations to a given number of time slots so that there are no conflicts. A conflict occurs if a student has to take more than one examination at the same time, or when the number of students that must take an exam exceeds the capacity of the classroom assigned. The objective is to minimize penalties from proximity constraints. We present new algorithms based on local search and report on an extensive experimental study. We consider also a variant where the concern is to produce conflict-free timetables minimizing the number of time slots, regardless of how close exams appear in the schedule. The algorithms proposed also manage the trade-off between the two objective functions and produce the best results on several standard benchmark instances, compared to the best existing algorithms.

[1]  Sanja Petrovic,et al.  A Novel Similarity Measure for Heuristic Selection in Examination Timetabling , 2004, PATAT.

[2]  Sanja Petrovic,et al.  Case-Based Initialisation of Metaheuristics for Examination Timetabling , 2005 .

[3]  Edmund K. Burke,et al.  Examination Timetabling in British Universities: A Survey , 1995, PATAT.

[4]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[5]  Graham Kendall,et al.  An Investigation of a Tabu-Search-Based Hyper-Heuristic for Examination Timetabling , 2005 .

[6]  Edmund K. Burke,et al.  Solving Examination Timetabling Problems through Adaption of Heuristic Orderings , 2004, Ann. Oper. Res..

[7]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[8]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[9]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[10]  Kathryn A. Dowsland,et al.  A robust simulated annealing based examination timetabling system , 1998, Comput. Oper. Res..

[11]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[12]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Ordering Criteria for Examination Timetabling , 2004 .

[13]  Edmund K. Burke,et al.  Applications to timetabling , 2004 .

[14]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Heuristic Orderings for Examination Timetabling , 2004, PATAT.

[15]  R. Sabourin,et al.  Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem , 2004 .

[16]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[17]  Peter J. Stuckey,et al.  A Hybrid Algorithm for the Examination Timetabling Problem , 2002, PATAT.

[18]  Robert Sabourin,et al.  A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem , 2004, PATAT.

[19]  George M. White,et al.  Examination Timetables and Tabu Search with Longer-Term Memory , 2000, PATAT.

[20]  Edmund K. Burke,et al.  Enhancing Timetable Solutions with Local Search Methods , 2002, PATAT.

[21]  Jonathan M. Thompson,et al.  GRASPing the Examination Scheduling Problem , 2002, PATAT.

[22]  Giuseppe F. Italiano,et al.  New Algorithms for Examination Timetabling , 2000, WAE.

[23]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[24]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .