Abstract
The School Timetabling Problem (STP) regards the weekly scheduling of encounters between teachers and classes. Since this scheduling must satisfy organizational, pedagogical and personal costs, this problem is recognized as a very difficult combinatorial optimization problem. This work presents a new Tabu Search (TS) heuristic for STP. Two different memory-based diversification strategies are presented. Computational experiments with real world instances, in comparison with a previously proposed TS found in literature, show that the proposed method produces better solutions for all instances, as well as observed increased speed in the production of good quality solutions.
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.
Similar content being viewed by others
References
Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribuition of solution time in GRASP: an experimental investigation. Journal of Heuristics 8, 343–373 (2002)
Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science 37, 98–113 (1991)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for High-School Timetabling. Computational Optimization and Applications 9, 277–298 (1998)
Costa, D.: A Tabu Search algorithm for computing an operational timetable. European Journal of Operational Research Society 76, 98–110 (1994)
Even, S., Itai, A., Shamir, A.: On the complexity of timetabling and multicommodity flow problems. SIAM Journal of Computation 5, 691–703 (1976)
Glover, F.: Future paths for integer programming and artificial intelligence. Computers & Operations Research 13, 533–549 (1986)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Hansen, P.: The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on Numerical Methods in Combinatorial Optimization, Capri (1986)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. Handbook of Metaheuristics, pp. 219–249. Kluwer, Dordrecht (2003)
Schaerf, A.: Tabu search techniques for large high-school timetabling problems. Report CS-R9611. Centrum voor Wiskunde en Informatica, Amsterdam (1996)
Souza, M.J.F.: Programação de Horários em Escolas: Uma Aproximação por Metaheur ísticas, D.Sc. Thesis (in Portuguese), Universidade Federal do Rio de Janeiro - Rio de Janeiro (2000)
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, pp. 659–672. Kluwer Academic Publishers, Boston (2003)
Wilke, P., Gröbner, M., Oster, N.: A hybrid genetic algorithm for school timetabling. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 455–464. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santos, H.G., Ochi, L.S., Souza, M.J.F. (2004). An Efficient Tabu Search Heuristic for the School Timetabling Problem. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive