Evolutionary learning algorithm for reliable facility location under disruption

被引:37
作者
Afify, Badr [1 ]
Ray, Sujoy [1 ]
Soeanu, Andrei [1 ]
Awasthi, Anjali [1 ]
Debbabi, Mourad [1 ]
Allouche, Mohamad [2 ]
机构
[1] Concordia Univ, Montreal, PQ, Canada
[2] DRDC, Valcartier, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Facility location; Reliability; Combinatorial optimization; Evolutionary learning; Heuristics; CHAIN NETWORK DESIGN; SUPPLY CHAIN; BOOSTING ALGORITHMS; MODELS; RISK;
D O I
10.1016/j.eswa.2018.07.045
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Facility location represents an important supply chain problem aiming at minimizing facility establishment and transportation cost to meet customer demands. Many facility location problem (FLP) instances can be modelled as p-median problems (PMP) and uncapacitated facility location (UFL) problems. While, most solution approaches assume totally reliable deployed facilities, facilities often experience disruptions and their failure often leads to a notably higher cost. Therefore, determination of facility locations and fortification of a subset of them within a limited budget are crucial to supply chain organizations to provide cost effective services in presence of probable disruptions. We propose an evolutionary learning technique to near-optimally solve two research problems: Reliable p-Median Problem and Reliable Uncapacitated Facility Location Problem considering heterogeneous facility failure probabilities, one layer of backup and limited facility fortification budget. The technique is illustrated using a case study and its performance is evaluated via benchmark results. We also provide an analysis on the effects on facility location by prioritizing customer demands and adopting geographic distance calculation. The approach allows fast generation of cost-effective and complete solution using reasonable computing power. Moreover, the underlying technique is customizable offering a trade-off between solution quality and computation time. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:223 / 244
页数:22
相关论文
共 50 条
[21]   Sample average approximation applied to the capacitated-facilities location problem with unreliable facilities [J].
Gade, D. ;
Pohl, E. A. .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART O-JOURNAL OF RISK AND RELIABILITY, 2009, 223 (O4) :259-269
[22]   Hybrid evolutionary evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems [J].
Guo, Peng ;
Cheng, Wenming ;
Wang, Yi .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 71 :57-68
[23]   Designing a Supply Chain Network under the Risk of Disruptions [J].
Jabbarzadeh, Armin ;
Naini, Seyed Gholamreza Jalali ;
Davoudpour, Hamid ;
Azad, Nader .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
[24]   The impact of operations anticipations on the quality of stochastic location-allocation models [J].
Klibi, Walid ;
Martel, Alain ;
Guitouni, Adel .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 62 :19-33
[25]   Scenario-based Supply Chain Network risk modeling [J].
Klibi, Walid ;
Martel, Alain .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (03) :644-658
[26]   The design of robust value-creating supply chain networks: A critical review [J].
Klibi, Walid ;
Martel, Alain ;
Guitouni, Adel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (02) :283-293
[27]   Integrated use of fuzzy c-means and convex programming for capacitated multi-facility location problem [J].
Kucukdeniz, Tarik ;
Baray, Alp ;
Ecerkale, Kubilay ;
Esnaf, Sakir .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (04) :4306-4314
[28]   A Fast Tabu Search Algorithm for the Reliable P-Median Problem [J].
Li, Qingwei ;
Savachkin, Alex .
ADVANCES IN GLOBAL OPTIMIZATION, 2015, 95 :417-424
[29]   Reliable facility location design under disruptions [J].
Li, Qingwei ;
Zeng, Bo ;
Savachkin, Alex .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) :901-909
[30]   A 1.488 approximation algorithm for the uncapacitated facility location problem [J].
Li, Shi .
INFORMATION AND COMPUTATION, 2013, 222 :45-58