Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility

被引:14
作者
Rohaninejad, Mohammad [1 ]
Sahraeian, Rashed [1 ]
Tavakkoli-Moghaddam, Reza [2 ]
机构
[1] Shahed Univ, Coll Engn, Dept Ind Engn, Tehran, Iran
[2] Univ Tehran, Coll Engn, Sch Ind Engn, Tehran, Iran
关键词
Facility location; Reliability; Multi-echelon supply chain design; Approximation algorithm; Sample average approximation algorithm; Greedy adding and substitution algorithm; SAMPLE AVERAGE APPROXIMATION; LOCATION DESIGN; HEURISTIC SOLUTION; NETWORK DESIGN; DISRUPTIONS; MODEL; UNCERTAINTY; ALGORITHM; OPTIMIZATION; FORMULATION;
D O I
10.1016/j.apm.2018.06.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper considers the design of a multi-echelon supply chain network with unreliable facilities when the facilities can be "hardened" (their capacity increased and their probability of full or partial failures decreased) by more investment. The objective function of the problem is the minimization of the expected costs, including the fixed and the service costs, in all the echelons of the supply chain such that maintaining the flow of the demand at different echelons of the network interconnects them. In order to see how the decisions of each echelon affect other echelons, we consider a scenario in which facilities at the lower echelons of the chain are customers to the higher echelons and vice versa. A new scenario-based formulation is proposed for the problem to effectively cover the outcomes of this uncertainty. Moreover, we discuss how to use this model to choose the location and the hardening level of each facility to be both inexpensive and reliable. These decisions lead to some managerial insights. Given the computational complexity of the model, especially for the large-scale problems, several efficient approximation algorithms are presented. Finally, the computational results are provided to show the validity of the proposed model and the efficiency of the algorithms in providing high-quality solutions within acceptable times. The results show that the adoption of the integrated approach at different echelons of the network through the cooperation between the owners of echelons is much more effective than the independent optimization of each one. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:321 / 337
页数:17
相关论文
共 38 条
[1]   An Efficient Approach for Solving Reliable Facility Location Models [J].
Aboolian, Robert ;
Cui, Tingting ;
Shen, Zuo-Jun Max .
INFORMS JOURNAL ON COMPUTING, 2013, 25 (04) :720-729
[2]  
Ali S., 2014, Innovation and Supply Chain Management Journal, V8, P81, DOI DOI 10.14327/ISCM.8.81
[3]  
Ali SM, 2015, OPER SUPPLY CHAIN MA, V8, P57
[4]   A multi-objective facility location model for closed-loop supply chain network under uncertain demand and return [J].
Amin, Saman Hassanzadeh ;
Zhang, Guoqing .
APPLIED MATHEMATICAL MODELLING, 2013, 37 (06) :4165-4176
[5]  
[Anonymous], INT J ENG SCI
[6]   A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem [J].
Aydin, Nezir ;
Murat, Alper .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 145 (01) :173-183
[7]   Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach [J].
Azad, Nader ;
Saharidis, Georgios K. D. ;
Davoudpour, Hamid ;
Malekly, Hooman ;
Yektamaram, Seyed Alireza .
ANNALS OF OPERATIONS RESEARCH, 2013, 210 (01) :125-163
[8]   THE MAXIMAL EXPECTED COVERING LOCATION PROBLEM - REVISITED [J].
BATTA, R ;
DOLAN, JM ;
KRISHNAMURTHY, NN .
TRANSPORTATION SCIENCE, 1989, 23 (04) :277-287
[9]   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
[10]   A population-based iterated greedy algorithm for the minimum weight vertex cover problem [J].
Bouamama, Salim ;
Blum, Christian ;
Boukerram, Abdellah .
APPLIED SOFT COMPUTING, 2012, 12 (06) :1632-1639