Decomposition, reformulation, and diving in university course timetabling

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 582-597

  Burke, Edmund K ^a   Mareček, Jakub ^a   Parkes, Andrew J ^a   Rudová, Hana ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Decomposition; Diving; Heuristic; Integer programming; Metaheuristic; Reformulation; Soft constraints; University course timetabling

Indexed keywords

DIVING; HEURISTIC; METAHEURISTIC; REFORMULATION; SOFT CONSTRAINTS; UNIVERSITY COURSE TIMETABLING;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; HEURISTIC PROGRAMMING; PETROLEUM REFINING; UNMANNED AERIAL VEHICLES (UAV);

INTEGER PROGRAMMING;

EID: 70349279898     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.02.023     Document Type: Article

References (73)

1. Abdullah S., Ahmadi S., Burke E.K., and Dror M. Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum 29 2 (2007) 351-372
2. Abdullah S., Ahmadi S., Burke E.K., Dror M., and McCollum B. A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. J Oper Res Soc 58 (2006) 1494-1502
3. Achterberg T. SCIP-A framework to integrate constraint and mixed integer programming. ZIB Technical Report TR-04-19; 2004.
4. Ahuja R.K., Ergun O., Orlin J.B., and Punnen A.P. A survey of very large-scale neighborhood search techniques. Discrete Appl Math 123 1-3 (2002) 75-102
5. Al-Yakoob S.M., and Sherali H.D. A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations. Eur J Oper Res 180 3 (2007) 1028-1044
6. Avella P., D'Auria B., Salerno S., and Vasil'Ev I. A computational study of local search algorithms for Italian high-school timetabling. J Heuristics 13 6 (2007) 543-556
7. Avella P., and Vasil'ev I. A computational study of a cutting plane algorithm for university course timetabling. J Scheduling 8 6 (2005) 497-514
8. Bardadym V.A. Computer-aided school and university timetabling: the new wave. In: Burke E.K., and Ross P. (Eds). Practice and theory of automated timetabling. Lecture notes in computer science vol. 1153 (1996), Springer, Berlin 22-45
9. Barnhart C., Johnson E.L., Nemhauser G.L., Sigismondi G., and Vance P. Formulating a mixed integer programming problem to improve solvability. Oper Res 41 6 (1993) 1013-1019
10. Berthold T. Heuristics of the branch-cut-and-price-framework SCIP. ZIB Technical Report TR-07-30, Berlin; 2007.
11. Berthold T. RENS-relaxation enforced neighborhood search. ZIB Technical Report TR-07-28, Berlin; 2007.
12. Beyrouthy C., Burke E.K., Landa-Silva D., McCollum B., McMullan P., and Parkes A.J. Towards improving the utilisation of university teaching space. J Oper Res Soc 60 1 (2009) 130-143
13. Bixby R.E., Fenelon M., Gu Z., Rothberg E., and Wunderling R. Mixed-integer programming: a progress report. In: Grötschel M. (Ed). The sharpest cut: the impact of Manfred Padberg and his work (2004), SIAM, Philadelphia, PA
14. Blum C., and Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35 3 (2003) 268-308
15. Bodlaender H.L., and Fomin F.V. Equitable colorings of bounded treewidth graphs. Theor Comput Sci 349 1 (2005) 22-30
16. Burke E., and Newall J. A multi-stage evolutionary algorithm for the timetable problem. IEEE Trans Evol Comput 13 1 (1999) 63-74
17. Burke E.K., de Werra D., and Kingston J.H. Applications to timetabling. In: Gross J.L., and Yellen J. (Eds). Handbook of graph theory (2004), CRC, London, UK 445-474
18. Burke E.K., Jackson K., Kingston J.H., and Weare R.F. Automated university timetabling: the state of the art. Comput J 40 9 (1997) 565-571
19. Burke EK, Mareček J, Parkes AJ, Rudová H. On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical Report NOTTCS-TR-2007-10, The University of Nottingham, Nottingham; 2007. Also available at: 〈http://arxiv.org/abs/0710.3603〉.
20. Burke EK, Mareček J, Parkes AJ, Rudová H. A branch-and-cut procedure for udine course timetabling. In: Burke EK, Gendreau M, editors. Proceedings of the 7th international conference on practice and theory of automated timetabling, PATAT 2008, Montréal, Canada, August 19-22, 2008. Montréal, Canada: Université de Montréal; 2008 [also appeared as NOTTCS-TR-2008-1].
21. Burke E.K., Mareček J., Parkes A.J., and Rudová H. Penalising patterns in timetables: novel integer programming formulations. In: Nickel S., and Kalcsics J. (Eds). Operations research proceedings 2007 (2008), Springer, Berlin 409-414
22. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. Eur J Oper Res 140 2 (2002) 266-280
23. Calégari P., Coray G., Hertz A., Kobler D., and Kuonen P. A taxonomy of evolutionary algorithms in combinatorial optimization. J Heuristics 5 2 (1999) 145-158
24. Carter M.W. A Lagrangian relaxation approach to the classroom assignment problem. INFORMS J Comput 27 (1989) 230-245
25. Carter M.W., and Laporte G. Recent developments in practical course timetabling. In: Burke E.K., and Carter M.W. (Eds). Practice and theory of automated timetabling. Lecture notes in computer science vol. 1408 (1998), Springer, Berlin 3-19
26. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Comput Oper Res 33 10 (2006) 2972-2990
27. Danna E., Rothberg E., and Pape C.L. Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102 1 (2005) 71-90
28. Daskalaki S., Birbas T., and Housos E. An integer programming formulation for a case study in university timetabling. Eur J Oper Res 153 (2004) 117-135
29. Daskalaki S., Birbas T., and Housos E. Efficient solutions for a university timetabling problem through integer programming. Eur J Oper Res 160 (2005) 106-120
30. Di Gaspero L, McCollum B, Schaerf A. The second international timetabling competition (ITC-2007): curriculum-based course timetabling (Track 3). Technical Report QUB/IEEE 2007/08/01, University of Udine DIEGM, Udine, Italy; 2007.
31. Di Gaspero L, Schaerf A. Multi neighborhood local search with application to the course timetabling problem. In: Burke EK, Causmaecker PD, editors. 4th international conference on practice and theory of automated timetabling, PATAT 2002, Gent, Belgium, August 21-23, 2002. Lecture notes in computer science, vol. 2740. Berlin: Springer; 2003. p. 262-75 [selected revised papers].
32. DiGaspero L., and Schaerf A. Neighborhood portfolio approach for local search applied to timetabling problems. J Math Model Algorithms 5 1 (2006) 65-89
33. Dimopoulou M., and Miliotis P. An automated university course timetabling system developed in a distributed environment: a case study. Eur J Oper Res 153 (2004) 136-147
34. Dueck G, Maehler M, Schneider J, Schrimpf G, Stamm-Wilbrandt H. Optimization with ruin recreate. US Patent 6418398; 2002.
35. El-Abd M., and Kamel M. A taxonomy of cooperative search algorithms. Hybrid metaheuristics. Lecture notes in computer science vol. 3636 (2005), Springer, Berlin 32-41
36. Even S., Itai A., and Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5 4 (1976) 691-703
37. Fischetti M., Glover F., and Lodi A. The feasibility pump. Math Program 104 1 (2005) 91-104
38. Fischetti M., and Lodi A. Local branching. Math Program 98 1 (2003) 23-47
39. Forrest J, de la Nuez D, Lougee-Heimer R. CLP User guide. Technical Report, Yorktown Heights, NY; 2004.
40. Gandibleux X., and Ehrgott M. 1984-2004-20 years of multiobjective metaheuristics. But what about the solution of combinatorial problems with multiple objectives?. In: Coello C.A.C., Aguirre A.H., and Zitzler E. (Eds). Evolutionary multi-criterion optimization. Lecture notes in computer science vol. 3410 (2005), Springer, Berlin 33-46
41. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman & Co, New York, NY
42. ILOG. ILOG CPLEX advanced programming techniques. ILOG S. A., Incline Village, NV; 2007.
43. Johnson E.L., Nemhauser G.L., and Savelsbergh M.W. Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J Comput 12 1 (2000) 2-23
44. Lach G, Lübbecke ME. Curriculum based course timetabling: optimal solutions to the udine benchmark instances. In: Burke EK, Gendreau M, editors. Proceedings of the 7th international conference on practice and theory of automated timetabling, PATAT 2008, Montréal, Canada, August 19-22, 2008. Montréal, Canada: Université de Montréal; 2008.
45. Lach G., and Lübbecke M.E. Optimal university course timetables and the partial transversal polytope. In: McGeoch C.C. (Ed). WEA. Lecture notes in computer science vol. 5038 (2008), Springer, Berlin 235-248
46. Lawrie N.L. An integer linear programming model of a school timetabling problem. Comput J 12 (1969) 307-316
47. Leung J., Kelly L., and Anderson J.H. Handbook of scheduling: algorithms models and performance analysis (2004), CRC, Boca Raton, FL
48. Lin S. Computer solutions to the travelling salesman problems. Bell Syst Tech J 44 10 (1965) 2245-2269
49. McCollum B. A perspective on bridging the gap between theory and practice in university timetabling. In: Burke EK, Rudová H, editors. 6th international conference on practice and theory of automated timetabling, PATAT 2006, Brno, The Czech Republic, August 30-September 1, 2006. Lecture notes in computer science, vol. 3867. Berlin: Springer; 2007. p. 3-23 [selected revised papers].
50. Meyers C, Orlin JB. Very large-scale neighborhood search techniques in timetabling problems. In: Practice and theory of automated timetabling. 2006. p. 24-39.
51. Mirhassani S.A. A computational approach to enhancing course timetabling with integer programming. Appl Math Comput 175 (2006) 814-822
52. Müller T. Itc2007 solver description: a hybrid approach. In: Burke EK, Gendreau M, editors. In: Proceedings of the 7th international conference on practice and theory of automated timetabling, PATAT 2008, Montréal, Canada, August 19-22, 2008. Montréal, Canada: Université de Montréal; 2008.
53. Murray K, Müller T, Rudová H. Modeling and solution of a complex university course timetabling problem. In: Burke EK, Rudová H, editors. 6th international conference on practice and theory of automated timetabling, PATAT 2006, Brno, The Czech Republic, August 30-September 1, 2006. Lecture notes in computer science, vol. 3867. Berlin: Springer; 2007. p. 189-209 [selected revised papers].
54. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization (1988), Wiley, New York, NY
55. Petrovic S., and Burke E.K. University timetabling. In: Leung J., Kelly L., and Anderson J.H. (Eds). Handbook of scheduling: algorithms, models, and performance analysis (2004), CRC, Boca Raton, FL 1001-1023
56. Pisinger D., and Røpke S. A general heuristic for vehicle routing problems. Comput Oper Res 34 (2007) 2403-2435
57. Puchinger J., and Raidl G.R. Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Mira J., and Álvarez J.R. (Eds). IWINAC (2). Lecture notes in computer science vol. 3562 (2005), Springer, Berlin 41-53
58. Qualizza A., and Serafini P. A column generation scheme for faculty timetabling. In: Burke E.K., and Trick M.A. (Eds). Practice and theory of automated timetabling. Lecture notes in computer science vol. 3616 (2005), Springer, Berlin 161-173
59. Raidl G.R. A unified view on hybrid metaheuristics. In: Almeida F., Aguilera M.J.B., Blum C., Moreno-Vega J.M., Pérez M.P., Roli A., and Sampels M. (Eds). Hybrid metaheuristics. Lecture notes in computer science vol. 4030 (2006), Springer, Berlin 1-12
60. Ralphs T.K., and Galati M.V. Decomposition and dynamic cut generation in integer linear programming. Math Program 106 2 (2006) 261-285
61. Ralphs T.K., Saltzman M.J., and Wiecek M.M. An improved algorithm for solving biobjective integer programs. Ann Oper Res 147 (2006) 43-70
62. Røpke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport Sci 40 (2006) 455-472
63. Rudová H, Murray K. University course timetabling with soft constraints. In: Burke EK, Causmaecker PD, editors. 4th international conference on practice and theory of automated timetabling, PATAT 2002, Gent, Belgium, August 21-23, 2002. Lecture notes in computer science, vol. 2740. Berlin: Springer; 2003. p. 310-328 [selected revised papers].
64. Schaerf A. A survey of automated timetabling. Artif Intell Rev 13 2 (1999) 87-127
65. Schimmelpfeng K., and Helber S. Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum 29 (2007) 783-803
66. Schrimpf G., Schneider J., Stamm-Wilbrandt H., and Dueck G. Record breaking optimization results using the ruin and recreate principle. J Comput Phys 159 2 (2000) 139-171
67. Tenenbaum J.B., de Silva V., and Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 290 (2000) 2319-2323
68. Trick M.A. Formulations and reformulations in integer programming. In: Bártk R., and Milano M. (Eds). Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture notes in computer science vol. 3524 (2005), Springer, Berlin 366-379
69. Tripathy A. School timetabling-a case in large binary integer linear programming. Manage Sci 30 (1984) 1473-1489
70. Welsh D.J.A., and Powell M.B. An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10 1 (1967) 85-86
71. Williams H.P. The reformulation of two mixed integer programming problems. Math Programm 14 3 (1978) 325-331
72. Wunderling R. Paralleler und objektorientierter simplex-algorithmus. ZIB Technical Report TR-96-09; 1996.
73. Zilberstein S. Using anytime algorithms in intelligent systems. AI Mag 17 3 (1996) 73-83