Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15819
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbdullah, Salwani-
dc.contributor.authorAhmadi, Samad-
dc.contributor.authorBurke, Edmund-
dc.contributor.authorDror, Moshe-
dc.date.accessioned2018-02-18T02:57:07Z-
dc.date.issued2007-04-
dc.identifier.urihttp://hdl.handle.net/1893/15819-
dc.description.abstractSince 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.en_UK
dc.language.isoen-
dc.publisherSpringer-
dc.relationAbdullah 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.-
dc.rightsThe 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.-
dc.subjectExamination timetablingen_UK
dc.subjectLarge neighbourhooden_UK
dc.subjectImprovement graphen_UK
dc.titleInvestigating Ahuja-Orlin's large neighbourhood search approach for examination timetablingen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31T00:00:00Z-
dc.rights.embargoreasonThe publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.-
dc.identifier.doihttp://dx.doi.org/10.1007/s00291-006-0034-7-
dc.citation.jtitleOR Spectrum-
dc.citation.issn0171-6468-
dc.citation.volume29-
dc.citation.issue2-
dc.citation.spage351-
dc.citation.epage372-
dc.citation.publicationstatusPublished-
dc.citation.peerreviewedRefereed-
dc.type.statusPublisher version (final published refereed version)-
dc.author.emaile.k.burke@stir.ac.uk-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationComputing Science and Mathematics-
dc.contributor.affiliationUniversity of Arizona-
dc.rights.embargoterms2999-12-31-
dc.rights.embargoliftdate2999-12-31-
dc.identifier.isi000244068800008-
Appears in Collections:Computing Science and Mathematics Journal Articles

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


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.