Solving a class of stochastic mixed-integer programs with branch and price

We begin this paper by identifying a class of stochastic mixed-integer programs that have column-oriented formulations suitable for solution by a branch-and-price algorithm (B&P). We then survey a number of examples, and use a stochastic facility-location problem (SFLP) for a detailed demonstration of the relevant modeling and solution techniques. Computational results with a scenario representation of uncertain costs, demands and capacities show that B&P can be orders of magnitude faster than solving the standard formulation by branch and bound. We also demonstrate how B&P can solve SFLP exactly – as exactly as a deterministic mixed-integer program – when demands and other parameters can be represented as certain types of independent, random variables, e.g., independent, normal random variables with integer means and variances.

[1]  Julia L. Higle,et al.  The C 3 theorem and a D 2 algorithm for large scale stochastic integer programming , 2000 .

[2]  E. Beale.  ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[3]  Konstantina Papagiannaki,et al.  Measurement and analysis of single-hop delay on an IP backbone network , 2003, IEEE J. Sel. Areas Commun..

[4]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[5]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[6]  T. Ralphs,et al.  COIN/BCP User’s Manual , 2001 .

[7]  François V. Louveaux,et al.  A Dual-Based Procedure for Stochastic Facility Location , 1992, Oper. Res..

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

[9]  R. Kevin Wood,et al.  A Stochastic Generalized Assignment Problem , 2004 .

[10]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

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

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

[13]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[14]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

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

[16]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

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

[18]  James R. Evans,et al.  Blending OR/MS, Judgment, and GIS: Restructuring P&G's Supply Chain , 1997 .

[19]  Zhi-Long Chen,et al.  A scenario-based stochastic programming approach for technology and capacity planning , 2002, Comput. Oper. Res..

[20]  Stephen J. Wright,et al.  Decomposition Algorithms for Stochastic Programming on a Computational Grid , 2001, Comput. Optim. Appl..

[21]  David M. Ryan,et al.  Flight Attendant Rostering for Short-Haul Airline Operations , 1997, Oper. Res..

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

[23]  H. Martin Weingartner,et al.  Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.

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

[25]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[26]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[27]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[28]  R. Rockafellar,et al.  Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility , 1976 .

[29]  Gilbert Laporte,et al.  Exact Solution to a Location Problem with Stochastic Demands , 1994, Transp. Sci..

[30]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[31]  Matthias Ehrgott,et al.  Constructing robust crew schedules with bicriteria optimization , 2002 .

[32]  Brunilde Sansò,et al.  Multicommodity flow models, failure propagation, and reliable loss network design , 1998, TNET.

[33]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

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

[35]  Chung-Piaw Teo,et al.  Warehouse-Retailer Network Design Problem , 2004, Oper. Res..

[36]  R. P. Harvey.  The decomposition principle for linear programs , 1964 .

[37]  Eduardo Ferreira Silva,et al.  Improving Branch-and-Price Algorithms and Applying Them to Stochastic Programs , 2004 .

[38]  Gerald G. Brown,et al.  Design and operation of a multicommodity production/distribution system using primal goal decomposition , 1987 .

[39]  R. Kevin Wood,et al.  Explicit-Constraint Branching for Solving Mixed-Integer Programs , 2000 .

[40]  A. Philpott,et al.  Column-Generation for Design of Survivable Electricity Distribution Networks , 2004 .

[41]  R. Wets,et al.  STOCHASTIC PROGRAMS WITH RECOURSE , 1967 .

[42]  Nikolaos V. Sahinidis,et al.  An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion , 2003, Oper. Res..

[43]  G. Dantzig.  23. A Decomposition Principle for Linear Programs , 1963 .

[44]  G. Nemhauser,et al.  Integer Programming , 2020 .

[45]  John R. Birge,et al.  Stochastic Unit Commitment Problem (あいまいさと不確実性を含む状況の数理的意思決定 研究集会報告集) , 2002 .

[46]  Stephen Miller,et al.  Optimized Crew Scheduling at Air New Zealand , 2001, Interfaces.

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

[48]  Roger J.-B. Wets,et al.  Programming under uncertainty: The complete problem , 1966 .

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

[50]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[51]  J. Barceló,et al.  A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .

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

[53]  John C. Butler,et al.  Optimizing Natural Gas Flows with Linear Programming and Scenarios , 1999 .

[54]  Suvrajeet Sen,et al.  A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems , 2004, Manag. Sci..

[55]  Baoding Liu,et al.  New stochastic models for capacitated location-allocation problem , 2003, Comput. Ind. Eng..

[56]  Purushothaman Damodaran,et al.  Branch-and-Price Methods for Prescribing Profitable Upgrades of High-Technology Products with Stochastic Demands , 2004, Decis. Sci..

[57]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[58]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[59]  Jørgen Tind,et al.  L-shaped decomposition of two-stage stochastic programs with integer recourse , 1998, Math. Program..