Minimal Perturbation Problem in Course Timetabling

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F05%3A00014771" target="_blank" >RIV/00216224:14330/05:00014771 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Minimal Perturbation Problem in Course Timetabling

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Practice and Theory of Automated Timetabling V

ISBN

978-3-540-30705-1

ISSN

—

e-ISSN

—

Number of pages

21

Pages from-to

—

Publisher name

Springer-Verlag GmbH

Place of publication

Heidelberg

Event location

Heidelberg

Event date

Jan 1, 2005

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000234857300008