Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15819
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
Authors: Abdullah, Salwani
Ahmadi, Samad
Burke, Edmund
Dror, Moshe
Contact Email: e.k.burke@stir.ac.uk
Keywords: Examination timetabling
Large neighbourhood
Improvement graph
Issue Date: Apr-2007
Publisher: Springer
Citation: Abdullah S, Ahmadi S, Burke E & Dror M (2007) Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling, OR Spectrum, 29 (2), pp. 351-372.
Abstract: Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of "adjacent" (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. We demonstrate that our approach produces some of the best known results on these problems.
Type: Journal Article
URI: http://hdl.handle.net/1893/15819
DOI Link: http://dx.doi.org/10.1007/s00291-006-0034-7
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Affiliation: University of Nottingham
University of Nottingham
Deputy Principal's Office
University of Arizona

Files in This Item:
File Description SizeFormat 
Investigating Ahuja-Orlins large neighbourhood search approach for examination timetabling.pdf276.98 kBAdobe PDFUnder Embargo until 31/12/2999     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.

This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.