An efficient tabu search heuristic for the school timetabling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 468-481

  Santos, Haroldo G ^a   Ochi, Luiz S ^a   Souza, Marcone J F ^b  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; OPTIMIZATION; TABU SEARCH; TEACHING;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; DIVERSIFICATION STRATEGIES; REAL-WORLD; SCHOOL TIMETABLING PROBLEMS; TABU SEARCH HEURISTIC;

SCHEDULING;

EID: 34948821553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_35     Document Type: Article

References (13)

1. Alex, R. M., Resende, M. G. C., Ribeiro, C. G.: Probability distribuition of solution time in GRASP: an experimental investigation, Journal of Heuristics, 8 (2002), 343-373
2. Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science. 37 (1991) 98-113.
3. Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for High-School Timetabling. Computational Optimization and Applications. 9 (1998) 277-298.
4. Costa, D.: A Tabu Search algorithm for computing an operational timetable. European Journal of Operational Research Society. 76 (1994) 98-110.
5. Even, S., Itai, A., Shamir, A.: On the complexity of timetabling and multicommodity flow problems. SIAM Journal of Computation. 5 (1976) 691-703.
6. Glover, F.: Future paths for integer programming and artificial intelligence. Computers & Operations Research. 13 (1986) 533-549.
7. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston Dordrecht London (1997)
8. Hansen, P.: The steepest ascent mildest descent heuristic for combinatorial programming. Congress on Numerical Methods in Combinatorial Optimization. Capri (1986)
9. Resende, M.G.C., Ribeiro. G.G.: Greedy randomized adaptive search procedures. Handbook of Metaheuristics. Kluwer. (2003) 219-249
10. Schaerf, A.: Tabu search techniques for large high-school timetabling problems. Report CS-R9611. Centrum voor Wiskunde en Informatica, Amsterdam (1996)
11. Souza, M. J.F.: Programação de Hordrios em Escolas: Uma Aproximação por Metaheurísticas, D.Sc. Thesis (in Portuguese), Universidade Federal do Rio de Janeiro - Rio de Janeiro (2000)
12. Souza, M.J.F., Ochi, L.S., Maculan, N.: A GRASP-Tabu search algorithm for solving school timetabling problems. In: Resende, M.G.C., Souza, J.P. (eds.): Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, Boston (2003) 659-672
13. Wilke, P, Gröbner, M., Oster, N.: A hybrid genetic algorithm for school timetabling. In: AI 2002: McKay B. and Slaney J. (eds.): Advances in Artificial Intelligence. Springer Lecture Notes in Computer Science, Vol. 2557. Springer-Verlag, New York (2002) 455-464