Abstract
Educational timetabling is one of the most researched topics in the field of timetabling. This problem consists of allocating a set of lectures to available rooms and periods, considering students and teachers requests and constraints. Several mathematical models for this problem can be found in the literature. The model considered in this paper is based on courses curricula of a university, proposed in the second International Timetabling Competition (ITC-2007). A maximum flow partial solution is used together with the GRASP constructive algorithm to generate a local solution improved by Simulated Annealing. Computational experiments were performed in ITC-2007 instances, and the results were compared to the best solutions of ITC-2007 and to the literature.
Supported by CNPq (process 301725/2016-0) and FAPES (process 73290475/2016).
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
References
Burke, E., Jackson, K., Kingston, J.H., Weare, R.: Automated university timetabling: the state of the art. Comput. J. 40(9), 565–571 (1997)
Di Gaspero, L., Schaerf, A., McCollum, B.: The second international timetabling competition (ITC-2007): curriculum-based course timetabling (track 3). Technical report (2007)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)
Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Kampke, E.H., Segatto, E.A., Boeres, M.C.S., Rangel, M.C., Mauri, G.R.: Neighborhood analysis on the university timetabling problem. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10406, pp. 148–164. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62398-6_11
Kampke, E.H., de Souza Rocha, W., Boeres, M.C.S., Rangel, M.C.: A GRASP algorithm with path relinking for the university courses timetabling problem. In: Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, vol. 3, pp. 1081–1087 (2015)
Kiefer, A., Hartl, R.F., Schnell, A.: Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann. Oper. Res. 252(2), 255–282 (2017)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30(1), 167–190 (2008)
Lü, Z., Hao, J.K.: Adaptive tabu search for course timetabling. Eur. J. Oper. Res. 200(1), 235–244 (2010)
Müller, T.: ITC2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429 (2009)
PATAT: International timetabling competition (2008). http://www.cs.qub.ac.uk/itc2007
Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87–127 (1999)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kampke, E.H., Scheideger, L.M., Mauri, G.R., Boeres, M.C.S. (2019). A Network Flow Based Construction for a GRASP\(+\)SA Algorithm to Solve the University Timetabling Problem. In: Misra, S., et al. Computational Science and Its Applications – ICCSA 2019. ICCSA 2019. Lecture Notes in Computer Science(), vol 11621. Springer, Cham. https://doi.org/10.1007/978-3-030-24302-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-24302-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24301-2
Online ISBN: 978-3-030-24302-9
eBook Packages: Computer ScienceComputer Science (R0)