Sciweavers

Share
EVOW
2001
Springer

Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results

11 years 4 months ago
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by local search using specific mutation operators. Thus, only valid (partial) timetables are generated which fulfill all hard constraints.
Marc Bufé, Tim Fischer, Holger Gubbels, Cla
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where EVOW
Authors Marc Bufé, Tim Fischer, Holger Gubbels, Claudius Häcker, Oliver Hasprich, Christian Scheibel, Karsten Weicker, Nicole Weicker, Michael Wenig, Christian Wolfangel
Comments (0)
books