Elective course student sectioning at Danish high schools
The Elective Course Student Sectioning (ECSS) problem is a yearly recurrent planning problem at the Danish high schools. The problem is of assigning students to elective classes given their requests such that as many requests are fulfilled and the violations of the soft constraints are minimized. This paper presents an Adaptive Large Neighborhood Search heuristic for the ESCC. The algorithm is applied to 80 real-life instances from Danish high schools and compared with solutions found by using the state-of-the-art MIP solver Gurobi. The algorithm has been implemented in the commercial product Lectio, and is thereby available for approximately 200 high schools in Denmark.
KeywordsEducation timetabling High school timetabling Student sectioning Elective course planning Adaptive large neighborhood search Integer programming
The authors thank Michael Bigom Herold from MaCom A/S for kindly helping determining the problem and setting the weights for the problem, and MaCom A/S for providing all the data.
- Azi, N., Gendreau, M., & Potvin, J.-Y. (2010). An adaptive large neighborhood search for a vehicle routing problem with multiple trips. CIRRELT.Google Scholar
- Balaprakash, P., Birattari, M., & Stützle, T. (2007). Improvement strategies for the f-race algorithm: Sampling design and iterative refinement. In Proceedings of the 4th international conference on Hybrid metaheuristics, HM’07. Springer, Berlin, pp. 108–122.Google Scholar
- Birattari, M. (2005). The problem of tuning metaheuristics as seen from a machine learning perspective (1st ed.). Dissertations in artificial intelligence—Infix (Vol. 292). Springer.Google Scholar
- Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the university of waterloo. In E. Burke & W. Erben (Eds.), Practice and theory of automated timetabling III. Lecture Notes in Computer Science (Vol. 2079, pp. 64–82) Berlin: Springer. ISBN 978-3-540-42421-5.Google Scholar
- Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In Ed. Burke & M. Carter (Eds.), Practice and theory of automated timetabling II. Lecture Notes in Computer Science (Vol. 1408, pp. 3–19). Berlin: Springer.Google Scholar
- de Haan, P., Landman, R., Post, G., & Ruizenaar, H. (2007). A case study for timetabling in a dutch secondary school. In E. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling VI. Lecture Notes in Computer Science (Vol. 3867, pp. 267–279). Berlin: Springer.Google Scholar
- Erben, W., & Keppler, J. (1996). A genetic algorithm solving a weekly course-timetabling problem. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling. Lecture Notes in Computer Science (Vol. 1153, pp. 198–211). Berlin: Springer.Google Scholar
- Muller, L. F., & Spoorendonk, S. (2010). A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem. DTU Management Engineering: Technical report.Google Scholar
- Muller, L. F. (2009). An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In MIC 2009: The VIII Metaheuristics International Conference.Google Scholar
- Pellegrini, P., & Birattari, M. (2007). Implementation effort and performance. pp. 31–45.Google Scholar
- Pillay, N. (2010). An overview of school timetabling research. In Proceedings of the international conference on the theory and practice of automated timetabling (pp. 321–335). Belfast, United Kingdom.Google Scholar
- Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of metaheuristics (Vol. 146, pp. 399–419). International Series in Operations Research & Management Science. New York: Springer. ISBN 978-1-4419-1665-5.Google Scholar
- Post, G., Di Gaspero, L., Kingston, J. H., McCollum, B., & Schaerf, A. (2012). The third international timetabling competition. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), Son, Norway.Google Scholar
- Rudova, H., & Murray, K. (2003). University course timetabling with soft constraints. In Practice and theory of automated timetabling IV, pp. 310–328.Google Scholar
- Shaw, P. (1997). A new local search algorithm providing high quality solutions to vehicle routing problems.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. R. (2013). Integer programming and adaptive large neighborhood search for real-world instances of high school timetabling. Annals of Operations Research, PATAT 2012 SI.Google Scholar
- Sørensen, M., Kristiansen, S., & Stidsen, T. R. (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. SINTEF.Google Scholar
- Steeg, J., & Schröder, M. (2008). A hybrid approach to solve the periodic home health care problem. In J. Kalcsics & S. Nickel (Eds.), Operations research proceedings 2007. Operations Research Proceedings (Vol. 2007, pp. 297–302). Berlin: Springer. ISBN 978-3-540-77903-2.Google Scholar
- Welsh, D. J. A., & Powell, M. B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1): 85–86. doi: 10.1093/comjnl/10.1.85. URL http://comjnl.oxfordjournals.org/content/10/1/85.abstract.