Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.authorQu, Rongen_UK
dc.contributor.authorSoghier, Amren_UK
dc.contributor.editorPelta, Daen_UK
dc.contributor.editorKrasnogor, Nen_UK
dc.contributor.editorDumitrescu D, Den_UK
dc.contributor.editorChira, Cen_UK
dc.contributor.editorLung, Ren_UK
dc.description.abstractGraph colouring heuristics have long been applied successfully to the exam timetabling problem. Despite the success of a few heuristic ordering criteria developed in the literature, the approaches lack the ability to handle the situations where ties occur. In this paper, we investigate the effectiveness of applying tie breakers to orderings used in graph colouring heuristics. We propose an approach to construct solutions for our problem after defining which heuristics to combine and the amount of each heuristic to be used in the orderings. Heuristic sequences are then adapted to help guide the search to find better quality solutions. We have tested the approach on the Toronto benchmark problems and are able to obtain results which are within the range of the best reported in the literature. In addition, to test the generality of our approach we introduced an exam timetabling instance generator and a new benchmark data set which has a similar format to the Toronto benchmark. The instances generated vary in size and conflict density. The publication of this problem data to the research community is aimed to provide researchers with a data set which covers a full range of conflict densities. Furthermore, it is possible using the instance generator to create random data sets with different characteristics to test the performance of approaches which rely on problem characteristics. We present the first results for the benchmark and the results obtained show that the approach is adaptive to all the problem instances that we address. We also encourage the use of the data set and generator to produce tailored instances and to investigate various methods on them.en_UK
dc.relationBurke E, Qu R & Soghier A (2011) An adaptive tie breaking and hybridisation hyper-heuristic for exam timetabling problems. In: Pelta D, Krasnogor N, Dumitrescu D D, Chira C & Lung R (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2011) Studies in Computational Intelligence, 387. Heidelberg: Springer, pp. 205-223.;
dc.relation.ispartofseriesStudies in Computational Intelligence, 387en_UK
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.en_UK
dc.subjectGraph theoryen_UK
dc.titleAn adaptive tie breaking and hybridisation hyper-heuristic for exam timetabling problemsen_UK
dc.typePart of book or chapter of booken_UK
dc.rights.embargoreason[An adaptive tie breaking and hybridisation hyper-heuristic.pdf] The 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.en_UK
dc.type.statusVoR - Version of Recorden_UK
dc.citation.btitleNature Inspired Cooperative Strategies for Optimization (NICSO 2011)en_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
rioxxterms.typeBook chapteren_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.authorQu, Rong|en_UK
local.rioxx.authorSoghier, Amr|en_UK
local.rioxx.projectInternal Project|University of Stirling|
local.rioxx.contributorPelta, Da|en_UK
local.rioxx.contributorKrasnogor, N|en_UK
local.rioxx.contributorDumitrescu D, D|en_UK
local.rioxx.contributorChira, C|en_UK
local.rioxx.contributorLung, R|en_UK
local.rioxx.filenameAn adaptive tie breaking and hybridisation hyper-heuristic.pdfen_UK
Appears in Collections:Computing Science and Mathematics Book Chapters and Sections

Files in This Item:
File Description SizeFormat 
An adaptive tie breaking and hybridisation hyper-heuristic.pdfFulltext - Published Version371.11 kBAdobe PDFUnder Embargo until 3000-12-01    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.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

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