Decomposition, reformulation, and diving in university course timetabling

In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a linear combination of such measures. This paper studies an approach to such problems, which can be thought of as multiphase exploitation of multiple objective-/value-restricted submodels. In this approach, only one computationally difficult component of a problem and the associated subset of objectives is considered at first. This produces partial solutions, which define interesting neighbourhoods in the search space of the complete problem. Often, it is possible to pick the initial component so that variable aggregation can be performed at the first stage, and the neighbourhoods to be explored next are guaranteed to contain feasible solutions. Using integer programming, it is then easy to implement heuristics producing solutions with bounds on their quality. Our study is performed on a university course timetabling problem used in the 2007 International Timetabling Competition (ITC), also known as the Udine Course Timetabling problem. The goal is to find an assignment of events to periods and rooms, so that the assignment of events to periods is a feasible bounded colouring of an associated conflict graph and the linear combination of the numbers of violations of four soft constraints is minimised. In the proposed heuristic, an objective-restricted neighbourhood generator produces assignments of periods to events, with decreasing numbers of violations of two period-related soft constraints. Those are relaxed into assignments of events to days, which define neighbourhoods that are easier to search with respect to all four soft constraints. Integer programming formulations for all subproblems are given and evaluated using ILOG CPLEX 11. The wider applicability of this approach is analysed and discussed.

[1]  Edmund K. Burke,et al.  Applications to timetabling , 2004 .

[2]  James B. Orlin,et al.  Very Large-Scale Neighborhood Search Techniques in Timetabling Problems , 2006, PATAT.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Andrea Qualizza,et al.  A Column Generation Scheme for Faculty Timetabling , 2004, PATAT.

[5]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[6]  Stefan Helber,et al.  Application of a real-world university-course timetabling model solved by integer programming , 2007, OR Spectr..

[7]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[8]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[9]  Edmund K. Burke,et al.  Towards improving the utilization of university teaching space , 2009, J. Oper. Res. Soc..

[10]  Dirk C. Mattfeld,et al.  A Computational Study , 1996 .

[11]  Moshe Dror,et al.  A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem , 2007, J. Oper. Res. Soc..

[12]  S. A. MirHassani.  A computational approach to enhancing course timetabling with integer programming , 2006, Appl. Math. Comput..

[13]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[14]  E. Burke,et al.  A Multi-stage Evolutionary Algorithm for the Timetable Problem General Cooling Schedules for a Simulated Annealing Based Timetabling System. References a Multi-stage Evolutionary Algorithm for the Timetable Problem , 1998 .

[15]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[16]  Timo Berthold.  Heuristics of the Branch-Cut-and-Price-Framework SCIP , 2007, OR.

[17]  Norman L. Lawrie.  An integer linear programming model of a school timetabling problem , 1969, Comput. J..

[18]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[19]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[20]  H. Paul Williams.  The reformulation of two mixed integer programming problems , 1978, Math. Program..

[21]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[22]  Luca Di Gaspero,et al.  Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.

[23]  Igor Vasil'ev,et al.  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling , 2005, J. Sched..

[24]  Ted K. Ralphs,et al.  Decomposition and Dynamic Cut Generation in Integer Linear Programming , 2006, Math. Program..

[25]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[26]  Edmund Ph. D. Burke,et al.  Practice and theory of automated timetabling II : second International Conference, PATAT '97, Toronto, Canada, August 20-22, 1997 : selected papers , 1998 .

[27]  Hanif D. Sherali,et al.  A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations , 2007, Eur. J. Oper. Res..

[28]  Michael W. Carter,et al.  A Lagrangian Relaxation Approach To The Classroom Assignment Problem , 1989 .

[29]  Michael A. Trick,et al.  Formulations and Reformulations in Integer Programming , 2005, CPAIOR.

[30]  Margaret M. Wiecek,et al.  An improved algorithm for solving biobjective integer programs , 2006, Ann. Oper. Res..

[31]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

[32]  Edmund K. Burke,et al.  On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling , 2007, ArXiv.

[33]  M. Kamel,et al.  A Taxonomy of Cooperative Search Algorithms , 2005, Hybrid Metaheuristics.

[34]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

[35]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[36]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Annals of Operations Research.

[37]  Martin Grötschel.  The Sharpest Cut , 2004, MPS-SIAM series on optimization.

[38]  Marco E. Lübbecke,et al.  Optimal University Course Timetables and the Partial Transversal Polytope , 2008, WEA.

[39]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[40]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[41]  Xavier Gandibleux,et al.  1984-2004 - 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives? , 2005, EMO.

[42]  Edmund K. Burke,et al.  Penalising Patterns in Timetables: Novel Integer Programming Formulations , 2007, OR.

[43]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[44]  Hana Rudová,et al.  University Course Timetabling with Soft Constraints , 2002, PATAT.

[45]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

[46]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[47]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[48]  Günther R. Raidi.  A unified view on hybrid metaheuristics , 2006 .

[49]  Igor Vasil'ev,et al.  A computational study of local search algorithms for Italian high-school timetabling , 2007, J. Heuristics.

[50]  Barry McCollum,et al.  A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling , 2006, PATAT.

[51]  Barry McCollum,et al.  The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

[52]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[53]  Sophia Daskalaki,et al.  Efficient solutions for a university timetabling problem through integer programming , 2005, Eur. J. Oper. Res..

[54]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[55]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[56]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[57]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[58]  Marco E. Lübbecke,et al.  Curriculum Based Course Timetabling: Optimal Solutions to the Udine Benchmark Instances , 2008 .

[59]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[60]  George L. Nemhauser,et al.  Formulating a Mixed Integer Programming Problem to Improve Solvability , 1993, Oper. Res..

[61]  Günther R. Raidl,et al.  A Unified View on Hybrid Metaheuristics , 2006, Hybrid Metaheuristics.

[62]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[63]  Tomás Müller,et al.  ITC2007 solver description: a hybrid approach , 2009, Ann. Oper. Res..

[64]  Moshe Dror,et al.  Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling , 2007, OR Spectr..

[65]  Tobias Achterberg,et al.  SCIP - a framework to integrate Constraint and Mixed Integer Programming , 2004 .

[66]  J. Mitchell.  Branch and Cut , 2011 .

[67]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[68]  Panagiotis Miliotis,et al.  An automated university course timetabling system developed in a distributed environment: A case study , 2004, Eur. J. Oper. Res..

[69]  Sanja Petrovic,et al.  University Timetabling , 2004, Handbook of Scheduling.

[70]  Fedor V. Fomin,et al.  Equitable Colorings of Bounded Treewidth Graphs , 2004, MFCS.

[71]  Timo Berthold,et al.  RENS - Relaxation Enforced Neighborhood Search , 2007 .

[72]  Edmund K. Burke,et al.  Automated University Timetabling: The State of the Art , 1997, Comput. J..

[73]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[74]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[75]  Alain Hertz,et al.  A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization , 1999, J. Heuristics.

[76]  Hana Rudová,et al.  Modeling and Solution of a Complex University Course Timetabling Problem , 2006, PATAT.

[77]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[78]  Stefan Nickel,et al.  Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007 , 2008, OR.

[79]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.