Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling

Date
2007-04-01
Authors
Ahmadi, Samad
Abdullah, S.
Burke, E.
Dror, M.
Journal Title
Journal ISSN
ISSN
1436-6304
Volume Title
Publisher
Springer Verlag
Peer reviewed
Abstract
Description
This has been a joint collaboration with the Universities of Arizona and Nottingham. It is one of the first implementations of very large neighbourhood structures. We extended the idea of large neighbourhoods to real instances of timetabling problems with a complex and interacting set of constraints. Discovery of the sequential moves used in our neighbourhood structure was from our innovative visual interface for timetabling problems (STARK). This interface has come out of our research with cognitive scientists at Nottingham University as part of an EPSRC funded project on humanising automated scheduling systems.
Keywords
RAE 2008, UoA 23 Computer Science and Informatics
Citation
Ahmadi, S. et al. (2007) Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum, 29(2), pp. 351-372.
Research Institute