Citation
Hybridizing Integer Programming Models with an Adaptive Decomposition Approach for Exam Timetabling Problems. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 435-446, 2009.
Paper
Abstract
The idea of decomposition has been successfully applied to address large combinatorial optimization problems across a range of applications. However, in timetabling, it has not been widely applied. One major difficulty of course, is that early assignment in one sub-problem may lead to later conflict in solving interrelated sub-problems. In our previous work, timetabling problems were adaptively decomposed into a difficult set and an easy set of exams. They were generated by using the information gathered from previous iterations during the problem solving. The approach obtained promising results and showed somewhat unsurprisingly, that a small set of difficult exams contributed to a much larger portion of the total cost of the solution constructed. An interesting issue, which is explored in this paper, is to investigate the effect of constructing complete solutions based on an optimal solution of this difficult sub-problem. In this paper, we first present an IP formulation for solving the difficult sub-problem. To have a tighter initial formulation, a well-known inequality called the Clique Inequality is utilized. We then examine the combinatorial properties of the problem to introduce a new family of cutting planes. These are shown to be helpful in obtaining a solution which is within a gap of less than 10% of optimal for the sub-problem, based on which the final solution is constructed. Promising results have been obtained on several benchmark exam timetabling problems in the literature.
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{2009-435-446-P, author = {R. Qu and F. He and E. K. Burke},
title = {Hybridizing Integer Programming Models with an Adaptive Decomposition Approach for Exam Timetabling Problems},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {435--446},
note = {Paper},
abstract = {The idea of decomposition has been successfully applied to address large combinatorial optimization problems across a range of applications. However, in timetabling, it has not been widely applied. One major difficulty of course, is that early assignment in one sub-problem may lead to later conflict in solving interrelated sub-problems. In our previous work, timetabling problems were adaptively decomposed into a difficult set and an easy set of exams. They were generated by using the information gathered from previous iterations during the problem solving. The approach obtained promising results and showed somewhat unsurprisingly, that a small set of difficult exams contributed to a much larger portion of the total cost of the solution constructed. An interesting issue, which is explored in this paper, is to investigate the effect of constructing complete solutions based on an optimal solution of this difficult sub-problem. In this paper, we first present an IP formulation for solving the difficult sub-problem. To have a tighter initial formulation, a well-known inequality called the Clique Inequality is utilized. We then examine the combinatorial properties of the problem to introduce a new family of cutting planes. These are shown to be helpful in obtaining a solution which is within a gap of less than 10% of optimal for the sub-problem, based on which the final solution is constructed. Promising results have been obtained on several benchmark exam timetabling problems in the literature.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-435-446-P.pdf} }