Abstract

In recent years, emergencies, including natural disasters and other public disasters, have seriously threatened the lives and property security of people all over the world. In order to save more people’s lives and reduce the losses caused by disasters, many researchers have carried out intensive study on the distribution of emergency supplies. This paper first studies Location-Routing Problem(LRP) of alternative logistics centers and material demand points, and constructs a multi-objective integer programming model based on the actual situation. The model consists of two objectives: (1) the minimum total transportation time; (2) the maximum total emergency material satisfaction. Then an algorithm is introduced to solve the above model: NSGA-II. Finally, the emergency materials distribution in Hubei Province is taken as an example to verify the applicability and effectiveness of the above method and the models.

Highlights

  • In recent years, earthquakes, floods, hurricanes, tsunamis and other emergencies continue to cause massive loss of life and property [1], causing widespread concern around the world

  • The symbols used in the following text are listed as follows: (1) Set and indices M: Number set of alternative logistics centers, M={1,2,...,m}; N: Number set of material demand points, N={m+1, m+2,...m + n}; P: Number set of nodes, P=M N; i,j: Path node, i,j P; E: Path link set, E={(i,j), i,j P, i j}; K: Number set of Transport vehicle, K={1,2,...,k}; k: Transport vehicle No k, k K. (2) Parameters m: Number of alternative logistics centers; n: Quantity of material demand points; k: Number of transport vehicles; tij: Transportation time of vehicle through link (i,j), (i,j) E; Qi: Quantity of emergency materials required at point i, i N; Q: Total amount of emergency materials in logistics system; UW: Weight of each emergency material; W: Load per vehicle

  • (3) Decision variables xi: 1, If the alternative logistics center is set at i,0 otherwise; yijk: 1, If i is the previous point of j on the path of vehicle k,0 otherwise, (i,j) E,k K; Zik: 1, If node i is on the path of vehicle k, 0 othsewise, i P, k K; qik: Quantity of emergency materials transported by vehicle k to demand point i, i N, k K; Uik: 1, If the last arriving node of vehicle k is i, 0 otherwise, i P, k K

Read more

Summary

Introduction

Earthquakes, floods, hurricanes, tsunamis and other emergencies continue to cause massive loss of life and property [1], causing widespread concern around the world. The effective distribution of post-disaster emergency rescue plays an important role in the postdisaster rescue operation, and the location of alternative logistics centers and the route selection of vehicles in the existing transportation network are the two of the most challenging issues in the emergency logistics [3]. In the post-disaster emergency material distribution system, issues like the location of alternative logistics centers, the ownership of transportation vehicles, the optimization of emergency material distribution route, and the distribution of emergency materials need to be solved systematically [4]. There is few research on the distribution of emergency materials for public health emergencies. This paper will use NSGA-II algorithm to solve the emergency material distribution problem of public health emergencies caused by infectious diseases

Problem description
Assumptions
Notations and definitions
Multi-objective mathematical model
NSGA-II
Algorithm design
Case study
Information of material demand points
Results
Objectives of optimization
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.