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

Authors:
Marc Bufé;Tim Fischer;Holger Gubbels;Claudius Häcker;Oliver Hasprich;Christian Scheibel;Karsten Weicker;Nicole Weicker;Michael Wenig;Christian Wolfangel
Affiliations:
-;-;-;-;-;-;-;-;-;-
Venue:
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Year:
2001

Citing 5
Cited 6

Metaheuristics for High School Timetabling

Computational Optimization and Applications
High school weekly timetabling by evolutionary algorithms

Proceedings of the 1999 ACM symposium on Applied computing
A Survey of Automated Timetabling

Artificial Intelligence Review
Timetabling the Classes of an Entire University with an Evolutionary Algorithm

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Tabu search techniques for large high-school timetabling problems

Tabu search techniques for large high-school timetabling problems

A Hybrid Genetic Algorithm for School Timetabling

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Applying evolutionary computation to the school timetabling problem: The Greek case

Computers and Operations Research
A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems

Journal of Scheduling
Solving the university timetabling problem with optimized enrollment of students by a self-adaptive genetic algorithm

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A case study for timetabling in a dutch secondary school

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A simulated annealing based approach to the high school timetabling problem

IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning

Quantified Score

Hi-index	0.00

Visualization

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.