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

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Ahmadi, Samad en
dc.contributor.author Abdullah, S. en
dc.contributor.author Burke, E. en
dc.contributor.author Dror, M. en
dc.date.accessioned 2008-11-24T13:57:21Z
dc.date.available 2008-11-24T13:57:21Z
dc.date.issued 2007-04-01 en
dc.identifier.citation Ahmadi, S. et al. (2007) Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum, 29(2), pp. 351-372.
dc.identifier.issn 1436-6304 en
dc.identifier.uri http://hdl.handle.net/2086/265
dc.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. en
dc.language.iso en en
dc.publisher Springer Verlag en
dc.subject RAE 2008
dc.subject UoA 23 Computer Science and Informatics
dc.title Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1007/s00291-006-0034-7 en
dc.researchgroup Software Technology Research Laboratory (STRL)


Files in this item

This item appears in the following Collection(s)

Show simple item record