Adaptive linear combination of heuristic orderings in constructing examination timetables

Abdul-Rahman, Syariza and Bargiela, Andrzej and Burke, Edmund and Özcan, Ender and McCollum, Barry and McMullan, Paul (2014) Adaptive linear combination of heuristic orderings in constructing examination timetables. European Journal of Operational Research, 232 (2). pp. 287-297. ISSN 0377-2217

[img] PDF - Repository staff only until 16 January 2017. - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (260kB)

Abstract

In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a heuristic modifier to address the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specific problem data. Two graph coloring heuristics were used in this study (largest degree and saturation degree). A score for the difficulty of assigning each examination was obtained from an adaptive linear combination of these two heuristics and examinations in the list were ordered based on this value. The examinations with the score value representing the higher difficulty were chosen for scheduling based on two strategies. We tested for single and multiple heuristics with and without a heuristic modifier with different combinations of weight values for each parameter on the Toronto and ITC2007 benchmark data sets. We observed that the combination of multiple heuristics with a heuristic modifier offers an effective way to obtain good solution quality. Experimental results demonstrate that our approach delivers promising results. We conclude that this adaptive linear combination of heuristics is a highly effective method and simple to implement.

Item Type: Article
Additional Information: NOTICE: this is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 232(2), (2014), doi: 10.1016/j.ejor.2013.06.052
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1016/j.ejor.2013.06.052
Depositing User: Ozcan, Dr Ender
Date Deposited: 27 Sep 2014 16:06
Last Modified: 13 Sep 2016 19:44
URI: http://eprints.nottingham.ac.uk/id/eprint/3386

Actions (Archive Staff Only)

Edit View Edit View