Abstract
This paper proposes a hybrid approach to solve school timetabling problems. This approach is a GRASP that uses a partially greedy procedure to construct an initial solution and attempts to improve the constructed solution using Tabu Search. When an infeasible solution without overlapping classes is generated, a procedure called Intraclasses-Interclasses is activated, trying to retrieve feasibility. If successful, it is reactivated, in an attempt to improve the timetable’s compactness as well as other requirements. Computational results show that the Intraclasses-Interclasses procedure speeds up the process of obtaining better 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.
Bibliography
D. Abramson. Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science, 37: 98–113, 1991.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey, 1993.
R. Alvarez-Valdes, G. Martin, and J.M. Tamarit. Constructing good solutions for the Spanish school timetabling problem. Journal of the Operational Research Society, 47: 1203–1215, 1996.
M.P. Carrasco and M.V. Pato. A multiobjective genetic algorithm for the class/teacher timetabling problem. In E.K. Burke and W. Erben, editors, Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science, pages 3–17. Springer-Verlag, Konstanz, Germany, 2001.
A. Colorni, M. Dorigo, and V. Maniezzo. Metaheuristics for high school timetabling. Computational Optimization and Applications, 9: 275–298, 1998.
D. Costa. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research, 76: 98–110, 1994.
S. Even, A. Itai, and A. Shamir. On the complexity of timetabling and multi-commodity flow problems. SIAM Journal of Computation, 5: 691–703, 1976.
T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109–133, 1995.
F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, 1997.
A. Schaerf. Tabu search techniques for large high-school timetabling problems. In Proceedings of the 30th National Conference on Artificial Intelligence, pages 363–368, 1996.
M.J.F. Souza. School timetabling: An approximation by metaheuristics. Phd thesis, Systems Engineering and Computer Science Program, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, December 2000. In Portuguese.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Souza, M.J.F., Maculan, N., Ochi, L.S. (2003). A GRASP-Tabu Search Algorithm for Solving School Timetabling Problems. In: Metaheuristics: Computer Decision-Making. Applied Optimization, vol 86. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4137-7_31
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4137-7_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5403-9
Online ISBN: 978-1-4757-4137-7
eBook Packages: Springer Book Archive