Abstract
Tabu Search is known to be an efficient metaheuristic in solving various hard combinatorial problems, which include timetabling. This paper applies Tabu Search to a real-world high school timetabling problem, which involves assigning courses with different lengths into appropriate periods. The proposed algorithm has two phases: initialization phase using greedy algorithm and improvement phase using Tabu Search. In Tabu Search algorithm, three kinds of moves are used: single moves, swap moves and block-changing moves. The algorithm’s implementation has been efficiently experimented on three real instances of two high schools in Vietnam.
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.
References
Nguyen, D.T.T., Khon, T.T.: Research on university timetabling algorithms. Bachelor Thesis, Information Technology Faculty, Ho Chi Minh University of Science, Vietnam (2007)
Glover, F.: Tabu Search - part I. ORSA J. Comput. 1(3), 190–206 (1989)
Schaerf, A.: A Survey of Automated Timetabling. Dipartimento di Informatica e Sistemistica, Dipartimento di Informatica e Sistemistica (1999)
Schaerf, A.: Tabu search techniques for large high-school timetabling problems. Computer Science/Department of Interactive Systems (1996)
Santos, H.G., Ochi, L.S., Souza, M.J.F.: A Tabu Search Heuristic with Efficient Diversification Strategies for the Class/Teacher Timetabling Problem. ACM J. E. A 10, 1–16 (2005)
Alvarez, R., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu Search. E. J. O. R. 137, 517–523 (2002)
McCollum, B., McMullan, P., Paechter, B., Lewis, R., Schaerf, A., Di Gaspero, L., Parkes, A.J., Qu, R., Burke, E.: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. Technical Report, Internaltional Timetabling Competition (2007)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for High School Timetabling. Comput. Optim. Appl. 9, 275–298 (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, New York (1997)
Abramson, D.: Constructing school timetables using Simulated Annealing: sequential and parallel algorithms. Management Science 37, 98–113 (1991)
Erben, W., Keppler, J.: A genetic algorithm solving a weekly course-timetabling problem. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 21–32. Springer, Heidelberg (1996)
Schaerf, A., Schaerf, M.: Local search techniques for high school timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 313–323. Springer, Heidelberg (1996)
Hertz, A.: Tabu search for large scale timetabling problems. E. J. O. R. 54, 39–47 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Minh, K.N.T.T., Thanh, N.D.T., Trang, K.T., Hue, N.T.T. (2010). Using Tabu Search for Solving a High School Timetabling Problem. In: Nguyen, N.T., Katarzyniak, R., Chen, SM. (eds) Advances in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12090-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-12090-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12089-3
Online ISBN: 978-3-642-12090-9
eBook Packages: EngineeringEngineering (R0)