Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/19400
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
Authors: Abdullah, Salwani
Ahmadi, Samad
Burke, Edmund
Dror, Moshe
McCollum, Barry
Contact Email: e.k.burke@stir.ac.uk
Keywords: examination timetabling
large neighbourhood
improvement graph
tabu search
Issue Date: Nov-2007
Publisher: Palgrave Macmillan
Citation: Abdullah S, Ahmadi S, Burke E, Dror M & McCollum B (2007) A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem, Journal of the Operational Research Society, 58 (11), pp. 1494-1502.
Abstract: Neighbourhood search algorithms are often the most effective known approaches for solving partitioning problems. In this paper, we consider the capacitated examination timetabling problem as a partitioning problem and present an examination timetabling methodology that is based upon the large neighbourhood search algorithm that was originally developed by Ahuja and Orlin. It is based on searching a very large neighbourhood of solutions using graph theoretical algorithms implemented on a so-called improvement graph. In this paper, we present a tabu-based large neighbourhood search, in which the improvement moves are kept in a tabu list for a certain number of iterations. We have drawn upon Ahuja-Orlin's methodology incorporated with tabu lists and have developed an effective examination timetabling solution scheme which we evaluated on capacitated problem benchmark data sets from the literature. The capacitated problem includes the consideration of room capacities and, as such, represents an issue that is of particular importance in real-world situations. We compare our approach against other methodologies that have appeared in the literature over recent years. Our computational experiments indicate that the approach we describe produces the best known results on a number of these benchmark problems.
Type: Journal Article
URI: http://hdl.handle.net/1893/19400
DOI Link: http://dx.doi.org/10.1057/palgrave.jors.2602258
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
Queen's University Belfast

Files in This Item:
File Description SizeFormat 
Abdullah et al_JORS_2007.pdf142.78 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.