Adaptive large neighborhood search for the curriculum-based course timetabling problem
- 305 Downloads
In curriculum-based course timetabling, lectures have to be assigned to periods and rooms, while avoiding overlaps between courses of the same curriculum. Taking into account the inherent complexity of the problem, a metaheuristic solution approach is proposed, more precisely an adaptive large neighborhood search, which is based on repetitively destroying and subsequently repairing relatively large parts of the solution. Several problem-specific operators are introduced. The proposed algorithm proves to be very effective for the curriculum-based course timetabling problem. In particular, it outperforms the best algorithms of the international timetabling competition in 2007 and finds five new best known solutions for benchmark instances of the competition.
KeywordsUniversity courses Timetabling Metaheuristics Adaptive large neighborhood search
The financial support by the Austrian Federal Ministry of Science, Research and Economy and the National Foundation for Research, Technology and Development is gratefully acknowledged. The computational results presented have been achieved in part using the Vienna Scientific Cluster (VSC). We acknowledge the constructive input by the anonymous reviewers.
- Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A., & Urli, T. (2016). Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers and Operations Research, 65, 83–92.Google Scholar
- Di Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical report QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1.0, Queen’s University, Belfast, UK.Google Scholar
- Kristiansen, S., & Stidsen, T. (2013). A comprehensive study of educational timetabling—A survey. DTU management engineering report, Department of Management Engineering, Technical University of Denmark.Google Scholar
- Muller, L. (2009). An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In MIC 2009: The VIII Metaheuristics international conference.Google Scholar
- Petrovic, S., & Burke, E. (2004). University timetabling. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis, chapter 45. Boca Raton: Chapman Hall/CRC Press.Google Scholar
- Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J. F. Puget (Eds.), Principles and practice of constraint programming—CP98. Lecture notes in computer science (Vol. 1520, pp. 417–431). Berlin: Springer.Google Scholar
- Sørensen, M., & Stidsen, T. (2012). High school timetabling: Modeling and solving a large number of cases in denmark. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp. 359–364.Google Scholar
- Sørensen, M., Kristiansen, S., & Stidsen, T. (2012). International timetabling competition 2011: An adaptive large neighborhood search algorithm. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp. 489–492.Google Scholar