Other formats:
BibTeX
LaTeX
RIS
@inproceedings{565573, author = {Müller, Tomáš and Rudová, Hana}, address = {Pittsburgh}, booktitle = {PATAT 2004 - Proceedings of the 5th international conference on the Practice And Theory of Automated Timetabling}, keywords = {dynamic problems; search algorithms; timetabling; constraint satisfaction; over-constrained problems}, location = {Pittsburgh}, isbn = {0-88748-413-1}, pages = {283-303}, title = {Minimal Perturbation Problem in Course Timetabling}, url = {http://www.fi.muni.cz/~hanka/publ/patat04.pdf}, year = {2004} }
TY - JOUR ID - 565573 AU - Müller, Tomáš - Rudová, Hana PY - 2004 TI - Minimal Perturbation Problem in Course Timetabling CY - Pittsburgh SN - 0887484131 KW - dynamic problems KW - search algorithms KW - timetabling KW - constraint satisfaction KW - over-constrained problems UR - http://www.fi.muni.cz/~hanka/publ/patat04.pdf N2 - Many real-life problems are dynamic, with changes in the problem definition occurring after a solution to the initial formulation has been reached. The 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 solution of an initial problem. 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. The methods proposed 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 -
MÜLLER, Tomáš and Hana RUDOVÁ. Minimal Perturbation Problem in Course Timetabling. In \textit{PATAT 2004 - Proceedings of the 5th international conference on the Practice And Theory of Automated Timetabling}. Pittsburgh, 2004, p.~283-303, 20 pp. ISBN~0-88748-413-1.
|