TY - JOUR
T1 - A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands
AU - Fattahi, Mohammad
AU - Govindan, Kannan
AU - Keyvanshokooh, Esmaeil
PY - 2018/12/1
Y1 - 2018/12/1
N2 - In this paper, we address a multi-period supply chain network redesign problem in which customer zones have price-dependent stochastic demand for multiple products. A novel multi-stage stochastic program is proposed to simultaneously make tactical decisions including products’ prices and strategic redesign decisions. Existing uncertainty in potential demands of customer zones is modeled through a finite set of scenarios, described in the form of a scenario tree. The scenarios are generated using a Latin Hypercube Sampling method and then a forward scenario construction technique is employed to create a suitable scenario tree. The multi-stage stochastic problem is formulated as a mixed-integer linear programming model and then Benders decomposition algorithm is applied for solving it. Numerical results demonstrate the significance of the stochastic model as well as the good performance of Benders algorithm. The scenario tree construction method is also evaluated in terms of out-of-sample and in-sample stability. Finally, several key managerial and practical insights in terms of pricing issues are highlighted.
AB - In this paper, we address a multi-period supply chain network redesign problem in which customer zones have price-dependent stochastic demand for multiple products. A novel multi-stage stochastic program is proposed to simultaneously make tactical decisions including products’ prices and strategic redesign decisions. Existing uncertainty in potential demands of customer zones is modeled through a finite set of scenarios, described in the form of a scenario tree. The scenarios are generated using a Latin Hypercube Sampling method and then a forward scenario construction technique is employed to create a suitable scenario tree. The multi-stage stochastic problem is formulated as a mixed-integer linear programming model and then Benders decomposition algorithm is applied for solving it. Numerical results demonstrate the significance of the stochastic model as well as the good performance of Benders algorithm. The scenario tree construction method is also evaluated in terms of out-of-sample and in-sample stability. Finally, several key managerial and practical insights in terms of pricing issues are highlighted.
KW - Supply chain network redesign
KW - Pricing and revenue management
KW - Multi-stage stochastic programming
KW - Non-anticipativity constraints
KW - Scenario reduction
KW - Benders decomposition
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85041645032&partnerID=MN8TOARS
U2 - 10.1016/j.cor.2017.12.016
DO - 10.1016/j.cor.2017.12.016
M3 - Article
VL - 100
SP - 314
EP - 332
JO - Surveys in Operations Research and Management Science
JF - Surveys in Operations Research and Management Science
SN - 0305-0548
ER -