Other formats:
BibTeX
LaTeX
RIS
@inproceedings{621512,
author = {Muller, Tomáš and Rudová, Hana and Barták, Roman},
address = {Heidelberg},
booktitle = {Practice and Theory of Automated Timetabling V},
keywords = {scheduling; timetabling; local search; constructive search; dynamic problems},
language = {eng},
location = {Heidelberg},
isbn = {978-3-540-30705-1},
note = {Practice and Theory of Automated Timetabling V, Revised and Selected Papers},
pages = {126-146},
publisher = {Springer-Verlag GmbH},
title = {Minimal Perturbation Problem in Course Timetabling},
url = {http://dx.doi.org/10.1007/11593577_8},
year = {2005}
}
TY - JOUR
ID - 621512
AU - Muller, Tomáš - Rudová, Hana - Barták, Roman
PY - 2005
TI - Minimal Perturbation Problem in Course Timetabling
PB - Springer-Verlag GmbH
CY - Heidelberg
SN - 9783540307051
N1 - Practice and Theory of Automated Timetabling V, Revised and Selected Papers
KW - scheduling
KW - timetabling
KW - local search
KW - constructive search
KW - dynamic problems
UR - http://dx.doi.org/10.1007/11593577_8
N2 - Many real-life problems are dynamic, with changes in the problem definition occurring after a solution to the initial formulation has been reached. A minimal perturbation problem incorporates these changes, along with the initial solution, as a new problem whose solution must be as close as possible to the initial solution. A new iterative forward search algorithm is proposed to solve minimal perturbation problems. Significant improvements to the solution quality are achieved by including new conflict-based statistics in this algorithm. The proposed methods were applied to find a new solution to an existing large scale class timetabling problem at Purdue University, incorporating the initial solution and additional input changes.
ER -
MULLER, Tomáš, Hana RUDOVÁ and Roman BARTÁK. Minimal Perturbation Problem in Course Timetabling. In \textit{Practice and Theory of Automated Timetabling V}. Heidelberg: Springer-Verlag GmbH, 2005, p.~126-146. ISBN~978-3-540-30705-1.
|
