Solving a new bi-objective model for relief logistics in a humanitarian supply chain using bi-objective meta-heuristic algorithms

被引:12
作者
Saatchi, H. Madani [1 ]
Khamseh, A. Arshadi [1 ]
Tavakkoli-Moghaddam, R. [2 ,3 ]
机构
[1] Kharazmi Univ, Dept Ind Engn, Fac Engn, Tehran, Iran
[2] Univ Tehran, Coll Engn, Sch Ind Engn, Tehran, Iran
[3] LCFC, Arts & Metiers ParisTech, Metz, France
关键词
Facility location; Relief logistics; Vehicle routing; Multi-objective; optimization; Forward-backward supply chain; VARIABLE NEIGHBORHOOD SEARCH; DISASTER RESPONSE; EVOLUTIONARY ALGORITHMS; PROGRAMMING-MODEL; OPTIMIZATION; NETWORK; TRANSPORTATION; ALLOCATION; LOCATION; DISRUPTIONS;
D O I
10.24200/sci.2020.53823.3438
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
One of the most important factors in a humanitarian supply chain during a disaster is a timely and efficient response. Delivering emergency commodities to the affected areas is also of significance in reducing consequences. Moreover, transferring the injured people in the fastest and shortest time period using all available resources is quite important. To this end, a multi-echelon multi-objective forward and backward relief network is proposed that considers the location of hospitals, local warehouses, and hybrid centers which are hospital-warehouse centers in the pre-disaster phase. In the post-disaster phase, routing the relief commodities should be considered in the forward route. In the backward route, some vehicles that can transfer the injured people after delivering commodities, called hybrid transportation facilities, will take the injured to hospitals and hybrid centers. According to the degree of hardness, a hybrid Non-dominated Sorting Genetic Algorithm (NSGA-II) with Simulated Annealing (SA) and Variable Neighborhood Search (VNS) algorithms was proposed to solve the given problems. The results obtained from this hybrid algorithm were compared with those from NSGA-II and multi-objective SA-VNS using five metrics (i.e., the number of Pareto, mean ideal distance, spacing, diversity, and time), and it was concluded that the proposed hybrid algorithm outperformed the two foregoing algorithms. (C) 2021 Sharif University of Technology. All rights reserved.
引用
收藏
页码:2948 / 2971
页数:24
相关论文
共 50 条
[1]   Stochastic network models for logistics planning in disaster relief [J].
Alem, Douglas ;
Clark, Alistair ;
Moreno, Alfredo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (01) :187-206
[2]   A two-stage stochastic programming framework for transportation planning in disaster response [J].
Barbarosoglu, G ;
Arda, Y .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (01) :43-53
[3]  
Berkoune D., 2012, Socio-Economic Planning Sciences, P23, DOI DOI 10.1016/J.SEPS.2011.05.002
[4]   A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty [J].
Bozorgi-Amiri, Ali ;
Jabalameli, M. S. ;
Al-e-Hashem, S. M. J. Mirzapour .
OR SPECTRUM, 2013, 35 (04) :905-933
[5]   Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem [J].
Brimberg, J ;
Hansen, P ;
Mladenovic, N ;
Taillard, ED .
OPERATIONS RESEARCH, 2000, 48 (03) :444-460
[6]   A novel multi-objective programming model of relief distribution for sustainable disaster supply chain in large-scale natural disasters [J].
Cao, Cejun ;
Li, Congdong ;
Yang, Qin ;
Liu, Yang ;
Qu, Ting .
JOURNAL OF CLEANER PRODUCTION, 2018, 174 :1422-1435
[7]   Allocation of temporary disaster response facilities under demand uncertainty: An earthquake case study [J].
Cavdur, Fatih ;
Kose-Kucuk, Merve ;
Sebatli, Asli .
INTERNATIONAL JOURNAL OF DISASTER RISK REDUCTION, 2016, 19 :159-166
[8]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[9]   Solving a location-routing problem with a multiobjective approach: the design of urban evacuation plans [J].
Coutinho-Rodrigues, Joao ;
Tralhao, Lino ;
Alcada-Almeida, Luis .
JOURNAL OF TRANSPORT GEOGRAPHY, 2012, 22 :206-218
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197