A GRASP-Tabu Search Algorithm for Solving School Timetabling Problems
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.
KeywordsMetaheuristics GRASP Tabu search School timetabling.
Unable to display preview. Download preview PDF.
- 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
- 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
- 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