A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi-stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017

[1]  Reinaldo Morabito,et al.  Routing and fleet deployment in liner shipping with spot voyages , 2015 .

[2]  Marianthi G. Ierapetritou,et al.  Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy , 2010, Comput. Chem. Eng..

[3]  Wei-Chen Cheng,et al.  Optimization and capacity expansion of a water distribution system , 2008 .

[4]  S. E. Jacobsen,et al.  An algorithm for optimizing network flow capacity under economies of scale , 1975 .

[5]  Kai Huang,et al.  Stochastic capacity expansion with multiple sources of capacity , 2014, Oper. Res. Lett..

[6]  An equilibrium price model of spot and forward shipping freight markets , 2012 .

[7]  Jay H. Lee,et al.  Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming , 2010 .

[8]  H. Luss.  Capacity expansion planning for a single facility product line , 1984 .

[9]  Geraldo Robson Mateus,et al.  Stochastic capacity planning and dynamic network design , 2013 .

[10]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[11]  F. Ordóñez,et al.  Robust capacity expansion of network flows , 2007 .

[12]  Jian Liu,et al.  Optimal network configuration and capacity expansion of railroads , 2008, J. Oper. Res. Soc..

[13]  K. Inderfurth,et al.  Capacity Reservation under Spot Market Price Uncertainty , 2011 .

[14]  D. J. Wu,et al.  Optimal Capacity Expansion in the Presence of Capacity Options , 2001 .

[15]  M. R. Rao,et al.  Optimal Network Capacity Planning: A Shortest-Path Scheme , 1975, Oper. Res..

[16]  Gérard P. Cachon.  Supply Chain Coordination with Contracts , 2003, Supply Chain Management.

[17]  John R. Birge,et al.  Option Methods for Incorporating Risk into Linear Capacity Planning Models , 2000, Manuf. Serv. Oper. Manag..

[18]  Zvi Ganz,et al.  The capacity expansion problem in the service industry , 1994, Comput. Oper. Res..

[19]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[20]  Kai Huang,et al.  The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty , 2009, Oper. Res..

[21]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[22]  Rasaratnam Logendran,et al.  A methodology for simultaneously dealing with machine duplication and part subcontracting in cellular manufacturing systems , 1997, Comput. Oper. Res..

[23]  S. D. Wu,et al.  Managing High-Tech Capacity Expansion via Reservation Contracts , 2009 .

[24]  Abraham P. Punnen,et al.  Optimal expansion of capacitated transshipment networks , 1996 .

[25]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[26]  M.C. Fu,et al.  A Markov decision process model for capacity expansion and allocation , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

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

[28]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[29]  Ángel Marín,et al.  Urban rapid transit network capacity expansion , 2008, Eur. J. Oper. Res..

[30]  Thomas L. Magnanti,et al.  Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics , 1990, Transp. Sci..

[31]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[32]  D. J. Wu,et al.  Integrating Long- and Short-Term Contracting via Business-to-Business Exchanges for Capital-Intensive Industries , 2003, Manag. Sci..

[33]  Robert L. Smith,et al.  Capacity Expansion Under Stochastic Demands , 1992, Oper. Res..

[34]  Steven T Waller,et al.  Integrated Network Capacity Expansion and Traffic Signal Optimization Problem: Robust Bi-level Dynamic Formulation , 2010 .

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

[36]  W. T. Huh,et al.  Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand , 2004 .

[37]  D. R. Fulkerson.  Increasing the Capacity of a Network: The Parametric Budget Problem , 1959 .

[38]  P. Brooker,et al.  Optimal expansion of an existing network , 1974, Math. Program..

[39]  Yeong-Dae Kim,et al.  Multi-period part selection and loading problems in flexible manufacturing systems , 1997 .

[40]  Alper Atamtürk,et al.  Capacity Acquisition, Subcontracting, and Lot Sizing , 2001, Manag. Sci..

[41]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[42]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[43]  Qingcheng Zeng,et al.  A study of the relationships between the time charter and spot freight rates , 2015 .

[44]  Fernando Ordóñez,et al.  Robust solutions for network design under transportation cost and demand uncertainty , 2008, J. Oper. Res. Soc..

[45]  M. R. Rao,et al.  Capacity of a Network with Increasing Demands and Arcs Subject to Failure , 1971, Oper. Res..

[46]  M. D. Devine,et al.  A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .

[47]  Jan A. Van Mieghem,et al.  Commissioned Paper: Capacity Management, Investment, and Hedging: Review and Recent Developments , 2003, Manuf. Serv. Oper. Manag..

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

[49]  Chae Y. Lee,et al.  Cell planning with capacity expansion in mobile communications: a tabu search approach , 2000, IEEE Trans. Veh. Technol..

[50]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[51]  Rainer Kleber,et al.  Dual sourcing using capacity reservation and spot market: Optimal procurement policy and heuristic parameter determination , 2013, Eur. J. Oper. Res..

[52]  Rasaratnam Logendran,et al.  Duplication of machines and subcontracting of parts in the presence of alternative cell locations , 1997 .

[53]  Huseyin Topaloglu,et al.  Cargo Capacity Management with Allotments and Spot Market Demand , 2012, Oper. Res..