A GRASP-Tabu Search Algorithm for Solving School Timetabling Problems

  • Marcone Jamilson Freitas Souza
  • Nelson Maculan
  • Luis Satoru Ochi
Part of the Applied Optimization book series (APOP, volume 86)


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.


Metaheuristics GRASP Tabu search School timetabling. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. D. Abramson. Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science, 37: 98–113, 1991.CrossRefGoogle Scholar
  2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey, 1993.zbMATHGoogle Scholar
  3. 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.zbMATHGoogle Scholar
  4. 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.CrossRefGoogle Scholar
  5. A. Colorni, M. Dorigo, and V. Maniezzo. Metaheuristics for high school timetabling. Computational Optimization and Applications, 9: 275–298, 1998.zbMATHCrossRefGoogle Scholar
  6. D. Costa. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research, 76: 98–110, 1994.zbMATHCrossRefGoogle Scholar
  7. 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.MathSciNetzbMATHCrossRefGoogle Scholar
  8. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109–133, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  9. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, 1997.zbMATHCrossRefGoogle Scholar
  10. 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.Google Scholar
  11. 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.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Marcone Jamilson Freitas Souza
    • 1
  • Nelson Maculan
    • 2
  • Luis Satoru Ochi
    • 3
  1. 1.Department of Computer ScienceFederal University of Ouro PretoOuro PretoBrazil
  2. 2.Systems Engineering and Computer Science ProgramFederal University of Rio de JaneiroRio de JaneiroBrazil
  3. 3.Department of Computer ScienceFluminense Federal UniversityNiteróiBrazil

Personalised recommendations