Abstract
Track 2 of the international timetabling competition 2007 was a post enrolment course timetabling problem. A set of events has to be assigned to a timeslot and to a room such that all students are able to attend their requested events while not violating the hard constraints. There are also soft constraints that make the timetable “nicer”.
We present a deterministic heuristic that assigns events to timeslots based on an LP-solution constructed with column generation. We get an integer solution by fixing columns one at a time. This heuristic finds a solution that obeys all the hard constraint for 23 of the 24 instances of the competition. The generated solution is improved by selecting a set of events that are reassigned by solving an integer program. This IP minimizes the number of soft constraint violations under the restriction that no hard constraints are violated. Comparing the results of our heuristic with the results of the five finalists of the competition, shows that our approach is competitive.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Atsuta, M., Nonobe, K., & Ibaraki, T. (2008). ITC-2007 Track2: an approach using general CSP solver. Submission to ITC2007 track 2.
Borndörfer, R. M., Grötschel, & Löbel, A. (2003). Duty scheduling in public transit. In W. Jäger & H.-J. Krebs (Eds.), Mathematics-key technology for the future (pp. 653–674). Berlin: Springer.
Cambazard, H., Hebrard, E., O’Sullivan, B., & Papadopoulos, A. (2008). Local search and constraint programming for the post-enrolment course timetabling problem. In Proceedings of the conference on the practice and theory of automated timetabling (PATAT 2008), Montreal, Canada, 2008.
Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling II. Berlin: Springer.
Chiarandini, M., Fawcett, C., & Hoos, H. H. (2008). A modular multiphase heuristic solver for post enrolment course timetabling. In Proceedings of the conference on the practice and theory of automated timetabling (PATAT 2008). Montreal, Canada, 2008.
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2001). Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In C. C. Ribiero & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 309–324). Boston: Kluwer.
Desrosiers, J., & Lübbecke, M. E. (2005). A primer in column generation. In Desaulniers, G., J. Desrosiers, & M. M. Solomon (Eds.), Column generation, Chap. 1 (pp. 1–32). New York: Springer.
Hutter, F., Babic, D., Hoos, H. H., & Hu (2007). Boosting verification by automatic tuning of decision procedures. In Formal methods in computer aided design (FMCAD).
International Timetabling Competition (ITC) (2007). http://www.cs.qub.ac.uk/itc2007.
Kostuch, P. (2004). The university course timetabling problem with a three-phase approach. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 109–125). Berlin: Springer.
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.
Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007–1023.
Mayer, A., Nothegger, C., Chwatal, A., & Raidl, G. R. (2008). Solving the post enrolment course timetabling problem by ant colony optimization. In Proceedings of the conference on the practice and theory of automated timetabling (PATAT 2008), Montreal, Canada, 2008.
Müller, T. (2008). ITC2007 solver description: a hybrid approach. In Proceedings of the conference on the practice and theory of automated timetabling (PATAT 2008), Montreal, Canada, 2008.
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 E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol. 2740. Practice and theory of automated timetabling IV (pp. 329–351). Berlin: Springer.
Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
van den Broek, J.J.J., Hurkens, C.A.J. An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Ann Oper Res 194, 439–454 (2012). https://doi.org/10.1007/s10479-010-0708-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0708-z