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.

• 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
• Keywords: Artificial Intelligence, EVOW 2001, School Timetables, School Timetabling Problem, Specific Mutation Operators