A Technical Review of Column Generation in Integer Programming

This paper provides a technical review of topics relevant to applying column generation methods to solve integer programs but emphasizes formulation issues as a means of achieving its goal, which is to bridge the gap between methodological development and application. Type I, II and III column generation approaches are described in detail and each is demonstrated by a set of prototypical formulations that provide a historical perspective of milestone contributions. Technical issues, including formulation, context, algorithm design and implementation are also related. Formulation issues encompass the restricted master problem (RMP) and subproblem (SP) structure, symmetry, complexity and the Integrality Property. Context issues comprise theoretical principles, dealing with binary or general integer variables and generating rows as well as columns. Algorithm design issues include branching strategies, SP solution strategies and problem-specific techniques. Implementation issues include determining an initial basic feasible solution, managing a pool of generated columns, optimizing the RMP at each iteration, and handling degeneracy and tailing off.

[1]  Karl Ernst Osthaus.  Van de Velde , 1920 .

[2]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[3]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[4]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[5]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[6]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[7]  J. Shapiro.  Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem , 1968 .

[8]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[9]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[10]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[11]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[12]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

[13]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[14]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[15]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

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

[17]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[18]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[19]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[20]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[21]  M Minoux,et al.  COLUMN GENERATION TECHNIQUES IN COMBINATORIAL OPTIMIZATION : A NEW APPLICATION TO CREW PAIRING , 1984 .

[22]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[23]  M M Etschmaier,et al.  AIRCRAFT SCHEDULING : THE STATE OF THE ART , 1984 .

[24]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[25]  Gerald G. Brown,et al.  Scheduling ocean transportation of crude oil , 1987 .

[26]  M. Minoux.  A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations , 1987 .

[27]  Teodor Gabriel Crainic,et al.  The Column Generation Principle And The Airline Crew Scheduling Problem , 1987 .

[28]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[29]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

[30]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[31]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

[32]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[33]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

[34]  Jacques Desrosiers,et al.  Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .

[35]  Monique Guignard-Spielberg,et al.  Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem , 1989, Oper. Res..

[36]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[37]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[38]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[39]  Ellis L. Johnson.  Modelling and strong linear programs for mixed integer programming , 1989 .

[40]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[41]  Ira Gershkoff,et al.  Optimizing Flight Crew Schedules , 1989 .

[42]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[43]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[44]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[45]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[46]  Martin Desrochers,et al.  A Breakthrough in Airline Crew Scheduling , 1991 .

[47]  Martin Desrochers,et al.  CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[48]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[49]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[50]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[51]  Dirk Cattrysse,et al.  A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .

[52]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[53]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[54]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[55]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[56]  Pamela H. Vance,et al.  Crew scheduling, cutting stock, and column generation :Solving huge integer programs , 1993 .

[57]  Richard D. McBride,et al.  Flight crew scheduling , 1993 .

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

[59]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[60]  Jacques Desrosiers,et al.  Daily Aircraft Routing and Scheduling , 1994 .

[61]  Cynthia Barnhart,et al.  A column-generation technique for the long-haul crew-assignment problem , 1994 .

[62]  Cynthia Barnhart,et al.  A column generation and partitioning approach for multi-commodity flow problems , 1994, Telecommun. Syst..

[63]  Mwp Martin Savelsbergh,et al.  A branch-and-price algorithm for the pickup and delivery problem with time windows , 1994 .

[64]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[65]  M Marc Sol.  Column generation techniques for pickup and delivery problems , 1994 .

[66]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[67]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[68]  David Pisinger.  A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[69]  Jean-Marc Rousseau,et al.  Results Obtained with Crew-Opt: A Column Generation Method for Transit Crew Scheduling , 1995 .

[70]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[71]  Gautam Mitra,et al.  Graph theoretic relaxations of set covering and set partitioning problems , 1995 .

[72]  Cynthia Barnhart,et al.  Deadhead Selection for the Long-Haul Crew Pairing Problem , 1995, Oper. Res..

[73]  Hanif D. Sherali,et al.  Tighter Representations for Set Partitioning Problems , 1996, Discret. Appl. Math..

[74]  Martin W. P. Savelsbergh,et al.  A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems , 1996, J. Heuristics.

[75]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[76]  van den Jm Marjan Akker,et al.  A time-indexed formulation for single-machine scheduling problems : column generation , 1996 .

[77]  Cynthia Barnhart,et al.  Integer Muticommodity Flow Problems , 1996, IPCO.

[78]  J. van de Klundert.  Scheduling problems in automated manufacturing , 1996 .

[79]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[80]  Robert F. Dell,et al.  The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon , 1996, Transp. Sci..

[81]  Craig A. Tovey,et al.  Circuit Partitioning Via Set Partitioning and Column Generation , 1996, Oper. Res..

[82]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[83]  Wilbert E. Wilhelm,et al.  A PROCEDURE FOR OPTIMIZING TACTICAL RESPONSE IN OIL SPILL CLEAN UP OPERATIONS , 1997 .

[84]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[85]  Velde van de Sl,et al.  A column generation algorithm for common due date scheduling , 1997 .

[86]  Sylvie Gélinas,et al.  Locomotive assignment with heterogeneous consists at CN North America , 1997 .

[87]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[88]  Wilbert E. Wilhelm,et al.  Prescribing tactical response for oil spill clean up operations , 1997 .

[89]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[90]  Jacques Desrosiers,et al.  The Preferential Bidding System at Air Canada , 1997, Transp. Sci..

[91]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[92]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[93]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[94]  Pierre Hansen,et al.  Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem , 1991, Eur. J. Oper. Res..

[95]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[96]  Terry P. Harrison,et al.  Lot-Sizing with Start-Up Times , 1998 .

[97]  Jean-François Cordeau,et al.  SIMULTANEOUS LOCOMOTIVE AND CAR ASSIGNMENT AT VIA RAIL CANADA , 1998 .

[98]  Gérard Cornuéjols,et al.  Decomposition of Balanced Matrices , 1999, J. Comb. Theory, Ser. B.

[99]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[100]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[101]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[102]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[103]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[104]  Wilbert E. Wilhelm,et al.  A Column-Generation Approach for the Assembly System Design Problem with Tool Changes , 1999 .

[105]  Cynthia Barnhart,et al.  Multimodal Express Package Delivery: A Service Network Design Application , 1999, Transp. Sci..

[106]  Jacques Desrosiers,et al.  A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..

[107]  François Vanderbeck,et al.  A Tactical Planning Model for Mixed-Model Electronics Assembly Operations , 1999, Oper. Res..

[108]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..

[109]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[110]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[111]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[112]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[113]  Kjetil Fagerholt,et al.  Ship scheduling with soft time windows: An optimisation based approach , 2001, Eur. J. Oper. Res..

[114]  Gérard Cornuéjols,et al.  Balanced 0-1 Matrices II. Recognition Algorithm , 2001, J. Comb. Theory, Ser. B.

[115]  Gérard Cornuéjols,et al.  Perfect, ideal and balanced matrices , 2001, Eur. J. Oper. Res..

[116]  Gérard Cornuéjols,et al.  Balanced 0-1 Matrices I. Decomposition , 2001, J. Comb. Theory, Ser. B.

[117]  José M. Valério de Carvalho.  A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems , 2002, Comput. Optim. Appl..

[118]  Albert P. M. Wagelmans,et al.  A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem , 1999, Oper. Res..