Solving the school time tabling problem using Tabu search, simulated annealing, genetic and branch & bound algorithms

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Wilke, Peter ^a   Ostler, Johannes ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Branch and bound algorithms; Genetic algorithms; School time tabling problem; Simulated annealing; Tabu search

Indexed keywords

BRANCH AND BOUND METHOD; GENETIC ALGORITHMS; SCHEDULING; TABU SEARCH;

BOUND ALGORITHMS; BRANCH-AND-BOUND ALGORITHMS; IDENTICAL CONDITIONS; OPTIMIZATION ALGORITHMS; PROBLEM SPECIFICATION; REAL-WORLD; TIME TABLING;

SIMULATED ANNEALING;

EID: 84902094182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Stefan Büttcher. Entwurf und Implementierung eines Genetischen Algorithmus zur Erstel-lung von Zeitplänen. Studienarbeit, Universität Erlangen–Nürnberg, 2002.
2. M. Gröbner and P. Wilke. A general view on timetabling problems. In Edmund Burke and Patrick De Causmaecker, editors, Proc. of the 4th International Conference on the Practice and Theory of Automated Timetabling, pages pp. 221–227. PATAT 2002, August 2002.
3. Matthias Gröbner. Ein Modell zur Beschreibung und Lösung von Zeitplanungsproblemen. Dissertation, Universität Erlangen–Nürnberg, 2003.
4. P. Wilke, M. Gröbner, and N. Oster. A hybrid genetic algorithm for school timetabling. In Proc. AI2002 15th Australian Joint Conference on Artificial Intelligence, 2002.