Supply chain design under uncertainty using sample average approximation and dual decomposition

We present a supply chain design problem modeled as a sequence of splitting and combining processes. We formulate the problem as a two-stage stochastic program. The first-stage decisions are strategic location decisions, whereas the second stage consists of operational decisions. The objective is to minimize the sum of investment costs and expected costs of operating the supply chain. In particular the model emphasizes the importance of operational flexibility when making strategic decisions. For that reason short-term uncertainty is considered as well as long-term uncertainty. The real-world case used to illustrate the model is from the Norwegian meat industry. We solve the problem by sample average approximation in combination with dual decomposition. Computational results are presented for different sample sizes and different levels of data aggregation in the second stage.

[1]  Gilbert Laporte,et al.  Stochastic uncapacitated hub location , 2011, Eur. J. Oper. Res..

[2]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[3]  James D. Hamilton Time Series Analysis , 1994 .

[4]  Gautam Mitra,et al.  Computational solution of capacity planning models under uncertainty , 2000, Parallel Comput..

[5]  Leen Stougie,et al.  Stochastic facility location with general long-run costs and convex short-run costs , 2008, Comput. Oper. Res..

[6]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[7]  Laureano F. Escudero,et al.  13. Modeling Production Planning and Scheduling under Uncertainty , 2005, Applications of Stochastic Programming.

[8]  Gloria Pérez,et al.  An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming , 2003, J. Glob. Optim..

[9]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[10]  Xiangtong Qi,et al.  A logistics scheduling model: scheduling and transshipment for two processing centers , 2006 .

[11]  Lawrence V. Snyder,et al.  Facility location under uncertainty: a review , 2006 .

[12]  Rüdiger Schultz,et al.  Dual decomposition in stochastic integer programming , 1999, Oper. Res. Lett..

[13]  Gautam Mitra,et al.  An application of Lagrangian relaxation to a capacity planning problem under uncertainty , 2001, J. Oper. Res. Soc..

[14]  Michal Kaut,et al.  A Heuristic for Moment-Matching Scenario Generation , 2003, Comput. Optim. Appl..

[15]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[16]  C. Lemaréchal Constructing Bundle Methods for Convex Optimization , 1986 .

[17]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

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

[19]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

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