Data-Driven Rolling Horizon Approach for Dynamic Design of Supply Chain Distribution Networks under Disruption and Demand Uncertainty

被引:51
作者
Fattahi, Mohammad [1 ]
Govindan, Kannan [2 ,3 ]
机构
[1] Shahrood Univ Technol, Dept Ind Engn & Management, Shahrood, Iran
[2] Shanghai Maritime Univ, China Inst FTZ Supply Chain, Shanghai 201306, Peoples R China
[3] Univ Southern Denmark, Ctr Sustainable Supply Chain Engn, Danish Inst Adv Study, Dept Technol & Innovat, DK-5230 Odense M, Denmark
关键词
Conic optimization; Data-driven rolling horizon approach; Dynamic supply chain network design; Multi-stage stochastic programming; Risk management; MULTISTAGE STOCHASTIC PROGRAM; FACILITY LOCATION; RISK; INVENTORY; CENTRALIZATION; MITIGATION; DECISIONS; FRAMEWORK; COSTS; MODEL;
D O I
10.1111/deci.12481
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We address the dynamic design of supply chain networks in which the moments of demand distribution function are uncertain and facilities' availability is stochastic because of possible disruptions. To incorporate the existing stochasticity in our dynamic problem, we develop a multi-stage stochastic program to specify the optimal location, capacity, inventory, and allocation decisions. Further, a data-driven rolling horizon approach is developed to use observations of the random parameters in the stochastic optimization problem. In contrast to traditional stochastic programming approaches that are valid only for a limited number of scenarios, the rolling horizon approach makes the determined decisions by the stochastic program implementable in practice and evaluates them. The stochastic program is presented as a quadratic conic optimization, and to generate an efficient scenario tree, a forward scenario tree construction technique is employed. An extensive numerical study is carried out to investigate the applicability of the presented model and rolling horizon procedure, the efficiency of risk-measurement policies, and the performance of the scenario tree construction technique. Several key practical and managerial insights related to the dynamic supply chain network design under uncertainty are gained based on the computational results.
引用
收藏
页码:150 / 180
页数:31
相关论文
共 49 条
[1]   Capacity planning and warehouse location in supply chains with uncertain demands [J].
Aghezzaf, E .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) :453-462
[2]   Convexity and decomposition of mean-risk stochastic programs [J].
Ahmed, S .
MATHEMATICAL PROGRAMMING, 2006, 106 (03) :433-446
[3]  
Alcantara P., 2017, BCI supply chain resilience report 2017
[4]   An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming [J].
Alonso-Ayuso, A ;
Escudero, LF ;
Garín, A ;
Ortuño, MT ;
Pérez, G .
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (01) :97-124
[5]   A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems [J].
Atamtuerk, Alper ;
Berenguer, Gemma ;
Shen, Zuo-Jun .
OPERATIONS RESEARCH, 2012, 60 (02) :366-381
[6]   Supply Chain Disruptions and Business Continuity: An Empirical Assessment [J].
Azadegan, Arash ;
Mellat Parast, Mahour ;
Lucianetti, Lorenzo ;
Nishant, Rohit ;
Blackhurst, Jennifer .
DECISION SCIENCES, 2020, 51 (01) :38-73
[7]   Facility reliability issues in network p-median problems:: Strategic centralization and co-location effects [J].
Berman, Oded ;
Krass, Dmitry ;
Menezes, Mozart B. C. .
OPERATIONS RESEARCH, 2007, 55 (02) :332-350
[8]   Forecast, solution, and rolling horizons in operations management problems: A classified bibliography [J].
Chand, Suresh ;
Hsu, Vernon Ning ;
Sethi, Suresh .
Manufacturing and Service Operations Management, 2002, 4 (01) :25-43
[9]   The severity of supply chain disruptions: Design characteristics and mitigation capabilities [J].
Craighead, Christopher W. ;
Blackhurst, Jennifer ;
Rungtusanatham, M. Johnny ;
Handfield, Robert B. .
DECISION SCIENCES, 2007, 38 (01) :131-156
[10]   Reliable Facility Location Design Under the Risk of Disruptions [J].
Cui, Tingting ;
Ouyang, Yanfeng ;
Shen, Zuo-Jun Max .
OPERATIONS RESEARCH, 2010, 58 (04) :998-1011