Skip to main content

Research Repository

Advanced Search

Adaptive selection of heuristics for improving exam timetables

Burke, Edmund; Qu, Rong; Soghier, Amr

Adaptive selection of heuristics for improving exam timetables Thumbnail


Authors

Edmund Burke

Profile Image

RONG QU rong.qu@nottingham.ac.uk
Professor of Computer Science

Amr Soghier



Abstract

This paper presents a hyper-heuristic approach which hybridises low-level heuristic moves to improve timetables. Exams which cause a soft-constraint violation in the timetable are ordered and rescheduled to produce a better timetable. It is observed that both the order in which exams are rescheduled and the heuristic moves used to reschedule the exams and improve the timetable affect the quality of the solution produced. After testing different combinations in a hybrid hyper-heuristic approach, the Kempe chain move heuristic and time-slot swapping heuristic proved to be the best heuristic moves to use in a hybridisation. Similarly, it was shown that ordering the exams using Saturation Degree and breaking any ties using Largest Weighted Degree produce the best results. Based on these observations, a methodology is developed to adaptively hybridise the Kempe chain move and timeslot swapping heuristics in two stages. In the first stage, random heuristic sequences are generated and automatically analysed. The heuristics repeated in the best sequences are fixed while the rest are kept empty. In the second stage, sequences are generated by randomly assigning heuristics to the empty positions in an attempt to find the best heuristic sequence. Finally, the generated sequences are applied to the problem. The approach is tested on the Toronto benchmark and the exam timetabling track of the second International Timetabling Competition, to evaluate its generality. The hyper-heuristic with low-level improvement heuristics approach was found to generalise well over the two different datasets and performed comparably to the state of the art approaches.

Citation

Burke, E., Qu, R., & Soghier, A. (2014). Adaptive selection of heuristics for improving exam timetables. Annals of Operations Research, 218(1), https://doi.org/10.1007/s10479-012-1140-3

Journal Article Type Article
Publication Date Jul 1, 2014
Deposit Date Feb 19, 2015
Publicly Available Date Mar 29, 2024
Journal Annals of Operations Research
Print ISSN 0254-5330
Electronic ISSN 1572-9338
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 218
Issue 1
DOI https://doi.org/10.1007/s10479-012-1140-3
Public URL https://nottingham-repository.worktribe.com/output/994948
Publisher URL http://link.springer.com/article/10.1007%2Fs10479-012-1140-3
Additional Information The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-012-1140-3

Files





You might also like



Downloadable Citations