A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands. (December 2018)

• Record Type: Journal Article
• Authors: Fattahi, Mohammad; Govindan, Kannan; Keyvanshokooh, Esmaeil
• Is Part Of: Computers & operations research. Volume 100(2018)
• Page Start: 314
• Page End: 332
• Publication Date: 2018-12
• Subjects: Supply chain network redesign -- Pricing and revenue management -- Multi-stage stochastic programming -- Non-anticipativity constraints -- Scenario reduction -- Benders decomposition; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2017.12.016
• Languages: English
• ISSNs: 0305-0548

Abstract

Abstract: 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.