Citation
Adaptive Decomposition and Construction for Examination Timetabling Problems. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 418-425, 2007.
Paper
Abstract
Decomposition techniques have not been widely investigated in timetabling research mainly due to the complexity of the problems. In this paper, we develop a new general adaptive decomposition technique where problems are iteratively partitioned into two sub-sets, each containing a set of events with different levels of difficulty. The events in these two sets, namely the difficult set and the easy set, are ordered in turn and used to construct the solutions. Potentially difficult events are adaptively included in the difficult set, whose size is also adaptively adjusted according to the solution quality obtained in previous iterations. It is observed that in most cases, the difficult set, although of small size, contributes to a much larger portion of the total cost of the solutions constructed. This simple yet effective adaptive technique obtained competitive solutions compared with state-of-the-art approaches in the literature for benchmark exam timetabling problems.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-418-425-P, author = {R. Qu and E. K. Burke},
title = {Adaptive Decomposition and Construction for Examination Timetabling Problems},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {418--425},
note = {Paper},
abstract = {Decomposition techniques have not been widely investigated in timetabling research mainly due to the complexity of the problems. In this paper, we develop a new general adaptive decomposition technique where problems are iteratively partitioned into two sub-sets, each containing a set of events with different levels of difficulty. The events in these two sets, namely the difficult set and the easy set, are ordered in turn and used to construct the solutions. Potentially difficult events are adaptively included in the difficult set, whose size is also adaptively adjusted according to the solution quality obtained in previous iterations. It is observed that in most cases, the difficult set, although of small size, contributes to a much larger portion of the total cost of the solutions constructed. This simple yet effective adaptive technique obtained competitive solutions compared with state-of-the-art approaches in the literature for benchmark exam timetabling problems.},
owner = {user},
timestamp = {2012.05.21},
webpdf = {2007-418-425-P.pdf} }