Abstract
We present a variety of approaches for solving the post enrolment-based course timetabling problem, which was proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using local search and constraint programming techniques. We show how to take advantage of a list-colouring relaxation of the problem. Our local search approach won Track 2 of the 2007 competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising, and provides motivation for studying complete approaches in further detail.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdullah, S., Burke, E. K., & McCollum, B. (2005). Using a randomised iterative improvement algorithm with composite neighbourhood structures for course timetabling. In MIC 05: the 6th meta-heuristic international conference.
Aggoun, A., & Beldiceanu, N. (1993). Extending chip in order to solve complex scheduling and placement problems. Mathematical Computing and Modelling, 17(7), 57–73.
Beldiceanu, N., Carlsson, M., Demassey, S., & Petit, T. (2007). Global constraint catalogue: past, present and future. Constraints, 12(1), 21–62.
Cambazard, H., Hladik, P. E., Déplanche, A. M., Jussien, N., & Trinquet, Y. (2004). Decomposition and learning for a real time task allocation problem. In Proc. of CP (pp. 153–167).
Carter, M. W., & Laporte, G. (1997). Recent developments in practical course timetabling. In PATAT (pp. 3–19).
Chiarandini, M., Birattari, M., Socha, K., & Rossi-Doria, O. (2006). An effective hybrid algorithm for university course timetabling. J. Scheduling, 9(5), 403–432.
Danna, E., & Perron, L. (2003). Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In CP (pp. 817–821).
de Siqueira, J. L., & Puget, J. F. (1988). Explanation-based generalisation of failures. In European conference on artificial intelligence (ECAI’88) (pp. 339–344).
de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19(2), 151–162.
Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms, 5(1), 65–89.
Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph colouring. Computers Operating Research, 33(9), 2547–2562.
Hooker, J. N., & Ottosson, G. (2003). Logic-based benders decomposition. Mathematical Programming, 96, 33–60.
Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing, 13, 258–276.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.
Kostuch, P. (2004). The university course timetabling problem with a three-phase approach. In PATAT (pp. 109–125).
Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1), 83–98.
Lewis, R., Paechter, B., & McCollum, B. (2007). Post enrolment based course timetabling: a description of the problem model used for track two of the second international timetabling competition (Technical report). Cardiff University.
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: engineering an efficient SAT solver. In Proceedings of the 38th design automation conference (DAC’01) (pp. 530–535).
Perron, L., & Shaw, P. (2004). Combining forces to solve the car sequencing problem. In CPAIOR (pp. 225–239).
Perron, L., Shaw, P., & Furnon, V. (2004). Propagation guided large neighborhood search. In CP (pp. 468–481).
Refalo, P. (2004). Impact-based search strategies for constraint programming. In CP (pp. 557–571).
Régin, J. C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th national conference on artificial intelligence (AAAI-94) (pp. 362–367).
Régin, J. C. (1996). Generalized arc consistency for global cardinality constraint. In National conference on artificial intelligence (AAAI’96) (pp. 209–215).
Régin, J. C. (1999). Arc consistency for a global cardinality constraints with costs. In Principles and practise of constraint programming (CP’99) (pp. 390–404).
Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L. M., Knowles, J. D., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & Stützle, T. (2002). A comparison of the performance of different metaheuristics on the timetabling problem. In PATAT (pp. 329–354).
Sadeh, N., & Fox, M. S. (1996). Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem. Artificial Intelligence, 86(1), 1–41.
Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.
Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In CP (pp. 417–431).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Science Foundation Ireland (Grant Number 05/IN/I886).
Rights and permissions
About this article
Cite this article
Cambazard, H., Hebrard, E., O’Sullivan, B. et al. Local search and constraint programming for the post enrolment-based course timetabling problem. Ann Oper Res 194, 111–135 (2012). https://doi.org/10.1007/s10479-010-0737-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0737-7