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.
KeywordsTime Slot Tabu Search Mutation Operator Constraint Violation Soft Constraint
Unable to display preview. Download preview PDF.
- 4.Carlos Fernandes, João Paulo Caldeira, Fernando Melicio, and Agostinho Rosa. High school weekly timetabling by evolutionary algorithms. In ACM SAC 99, pages 344–350, New York, 1999. ACM.Google Scholar
- 6.Emma Hart and David Corne. The state of the art in evolutionary approaches to timetabling and scheduling. EvoStim-The EVONET Working Group on Evolutionary Scheduling and timetabling, 1998.Google Scholar
- 7.Alberto Colorni, Marco Dorigo, and Vittorio Maniezzo. Genetic algorithms: A new approach to the time-table problem. In M. Akgül, editor, Combinatorial Optimization, pages 235–239. Springer, Berlin, 1990.Google Scholar
- 8.Andrea Schaerf. Tabu search techniques for large high-school timetabling problems. Technical Report CS-R9611, CWI, Amsterdam, NL, 1996.Google Scholar
- 9.Ben Paechter, R.C. Rankin, Andrew Cumming, and Terence C. Fogarty. Timetabling the classes of an entire university with an evolutionary algorithm. In Agoston E. Eiben, Thomas Bäck, Marc Schoenauer, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature-PPSN V, pages 865–874, Berlin, 1998. Springer. Lecture Notes in Computer Science 1498.CrossRefGoogle Scholar