Abstract
The High School Timetabling Problem remains subject of many research in Artificial Intelligence and Operational Research fields because of its hardness to solve and practical importance. A solution for this problem basically consists in the schedule of lessons to timeslots and the assignment of resources for these lessons. This work considers the solution of the problem of the ongoing Third International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simulated Annealing. One important structural feature of our approach is the use of the KHE engine to generate initial solutions combined with a multi-neighborhood search approach. The achieved results were encouraging: nine out of seventeen feasible solutions were found and five out of twenty one all-time best solutions were improved or matched in the processing limit stipulated in the ITC.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Barbosa, S.H., Souza, S.R.: Resolução do problema de programação de cursos universitários baseada em currículos via uma meta-heurística híbrida grasp-ils-relaxado. In: Proceedings of XLIII SBPO XLIII Simpósio Brasileiro de Pesquisa Operacional. SOBRAPO, Ubatuba, pp. 1:2827–1:2882 (2011)
Bufé, M., Fischer, T., Gubbels, H., Häcker, C., Hasprich, O., Scheibel, C., Weicker, K., Weicker, N., Wenig, M., Wolfangel, C.: Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 431–440. Springer, Heidelberg (2001)
de Haan, P., Landman, R., Post, G., Ruizenaar, H.: A Case Study for Timetabling in a Dutch Secondary School. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 267–279. Springer, Heidelberg (2007)
Garey, M.R., Jonhson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Glover, F., Kochenberger, G.: Handbook of Metaheuristics. International Series in Operations Research & Management Science. Kluwer Academic Publishers (2003)
Gotlieb, C.C.: The construction of class-teacher time-tables. In: Proc. IFIP Congress, pp. 73–77. North Holland Pub. Co., Munich (1963)
Kingston, J.H.: A Tiling Algorithm for High School Timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 208–225. Springer, Heidelberg (2005)
Kingston, J.H.: Hierarchical Timetable Construction. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 294–307. Springer, Heidelberg (2007)
Kingston, J.H.: A software library for school timetabling. Disponível em (2012), http://sydney.edu.au/engineering/it/~jeff/khe/ (acessado em Abril de 2012)
Kirkpatrick, S., Gellat, D.C., Vecchi, M.P.: Otimization by simulated annealing. Science 202, 671–680 (1983)
Lú, Z., Hao, J.-K.: Adaptive tabu search for course timetabling. European Journal of Operational Research 200(1), 235–244 (2010)
Muller, T.: Itc2007 solver description: a hybrid approach. Annals OR 172(1), 429–446 (2009)
Nurmi, K., Kyngas, J.: A framework for school timetabling problem. In: Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, pp. 386–393 (2007)
Post, G., Ahmadi, S., Daskalaki, S., Kingston, J.H., Kyngas, J., Nurmi, C., Ranson, D.: An Xml Format for Benchmarks in High School Timetabling. Annals of Operations Research 3867, 267–279 (2010)
Santos, H.G., Uchoa, E., Ochi, L.S., Maculan, N.: Strong bounds with cut and column generation for class-teacher timetabling. Annals OR 194(1), 399–412 (2012)
Valourix, C., Housos, E.: Constraint programming approach for school timetabling. Computers & Operations Research 30, 1555–1572 (2003)
Wright, M.: School timetabling using heuristic search. Journal of Operational Research Society 47, 347–357 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fonseca, G.H.G., Brito, S.S., Santos, H.G. (2012). A Simulated Annealing Based Approach to the High School Timetabling Problem. In: Yin, H., Costa, J.A.F., Barreto, G. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2012. IDEAL 2012. Lecture Notes in Computer Science, vol 7435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32639-4_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-32639-4_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32638-7
Online ISBN: 978-3-642-32639-4
eBook Packages: Computer ScienceComputer Science (R0)