TY - JOUR
T1 - An integrated location-inventory-routing humanitarian supply chain network with pre-and post-disaster management considerations
AU - Tavana, Madjid
AU - Abtahi, Amir-Reza
AU - Di Caprio, Debora
AU - Hashemi, Reza
AU - Yousefi Zenouz, Reza
PY - 2018/12/1
Y1 - 2018/12/1
N2 - Efficiency is a key success factor in complex supply chain networks. It is imperative to ensure proper flow of goods and services in humanitarian supply chains in response to a disaster. To this end, we propose a multi-echelon humanitarian logistic network that considers the location of central warehouses, managing the inventory of perishable products in the pre-disaster phase, and routing the relief vehicles in the post-disaster phase. An epsilon-constraint method, a non-dominated sorting genetic algorithm (NSGA-II), and a modified NSGA-II called reference point based non-dominated sorting genetic algorithm-II (RPBNSGA-II) are proposed to solve this mixed integer linear programming (MILP) problem. The analysis of variance (ANOVA) is used to analyze the results showing that NSGA-II performs better than the other algorithms with small size problems while RPBNSGA-II outperforms the other algorithms with large size problems.
AB - Efficiency is a key success factor in complex supply chain networks. It is imperative to ensure proper flow of goods and services in humanitarian supply chains in response to a disaster. To this end, we propose a multi-echelon humanitarian logistic network that considers the location of central warehouses, managing the inventory of perishable products in the pre-disaster phase, and routing the relief vehicles in the post-disaster phase. An epsilon-constraint method, a non-dominated sorting genetic algorithm (NSGA-II), and a modified NSGA-II called reference point based non-dominated sorting genetic algorithm-II (RPBNSGA-II) are proposed to solve this mixed integer linear programming (MILP) problem. The analysis of variance (ANOVA) is used to analyze the results showing that NSGA-II performs better than the other algorithms with small size problems while RPBNSGA-II outperforms the other algorithms with large size problems.
U2 - 10.1016/j.seps.2017.12.004
DO - 10.1016/j.seps.2017.12.004
M3 - Article
SN - 0038-0121
VL - 64
SP - 21
EP - 37
JO - Socio-Economic Planning Sciences
JF - Socio-Economic Planning Sciences
ER -