Abstract
Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the University of Melbourne is introduced, and the hybrid method is proved to be superior to the current method employed by the University. Finally, the hybrid method is compared to established methods on the publicly available data sets, and found to perform well in comparison.
Original language | English |
---|---|
Title of host publication | Practice and Theory of Automated Timetabling IV |
Subtitle of host publication | 4th International Conference, PATAT 2002 Gent, Belgium, August 21-23, 2002 Selected Revised Papers |
Editors | Edmund Burke, Patrick De Causmaecker |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 207-231 |
Number of pages | 25 |
ISBN (Print) | 3540406999 |
DOIs | |
Publication status | Published - 1 Dec 2003 |
Externally published | Yes |
Event | Practice and Theory of Automated Timetabling 2002 - Gent, Belgium Duration: 21 Aug 2002 → 23 Aug 2002 Conference number: 4th |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2740 |
ISSN (Print) | 0302-9743 |
Conference
Conference | Practice and Theory of Automated Timetabling 2002 |
---|---|
Abbreviated title | PATAT 2002 |
Country/Territory | Belgium |
City | Gent |
Period | 21/08/02 → 23/08/02 |