- Title
- A hybrid algorithm for the examination timetabling problem
- Creator
- Merlot, Liam T. G.; Boland, Natashia; Hughes, Barry D.; Stuckey, Peter J.
- Relation
- Practice and theory of automated timetabling IV: 4th international conference, PATAT 2002, Gent, Belgium, August 21-23, 2002: selected revised papers p. 207-231
- Relation
- Lecture Notes in Computer Science 2740
- Relation
- http://www.springer.com/computer/theoretical+computer+science/book/978-3-540-40699-0
- Publisher
- Springer
- Resource Type
- book chapter
- Date
- 2003
- Description
- 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.
- Subject
- examination timetabling; hybrid algorithms; combinatorial optimization problems; constraint programming; exams
- Identifier
- http://hdl.handle.net/1959.13/939372
- Identifier
- uon:12788
- Identifier
- ISBN:9783540406990
- Language
- eng
- Hits: 2217
- Visitors: 2656
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|