Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrea Schaerf. A survey of automated timetabling. Artificial Intelligence Review, 13(2):87–127, 1999.
S. Even, A. Itai, and A. Shamir. On the complexity of timetabling and multicommodity flow problems. SIAM Journal of Computation, 5(4):691–703, 1976.
Alberto Colorni, Marco Dorigo, and Vittorio Maniezzo. Metaheuristics for high-school timetabling. Computational Optimization and Applications, 9(3):277–298, 1998.
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.
Werner Junginger. Timetabling in germany-a survey. Interfaces, 16(4):66–74, 1986.
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.
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.
Andrea Schaerf. Tabu search techniques for large high-school timetabling problems. Technical Report CS-R9611, CWI, Amsterdam, NL, 1996.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bufé, M. et al. (2001). Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_45
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive