Minimal Perturbation Problem in Course Timetabling [chapter]

Tomáš Müller, Hana Rudová, Roman Barták
2005 Lecture Notes in Computer Science  
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
more » ... nflict-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.
doi:10.1007/11593577_8 fatcat:sjyglcxusjcodakupabc5yeajm