Abstract

This study establishes an optimization model of emergency material dispatch with the objectives of the highest reliability and lowest cost when the time frame is uncertain and the emergency material must be dispatched from multiple depot locations to multiple disaster sites. Because the two objectives are not consistent with one another, we propose an algorithm for solving the model by introducing the concept of ideal points, whereby the ideal point between the two objectives is considered the best plan. The study also proves the feasibility and validity of the algorithm with real-life examples.

Highlights

  • Sudden disasters and accidents pose a substantial threat to society, safety, and property

  • China is a country with frequent natural disasters

  • Yamada viewed the emergency materials dispatch problem in terms of the shortest transport route within a network, which he transformed into an investigation of a network flow algorithm under the condition of road capacity limitation [3]

Read more

Summary

Introduction

Sudden disasters and accidents pose a substantial threat to society, safety, and property. Ghaffari-Nasab et al calculated the location-routing problem (LRP) based on probabilistic transport time and used different stochastic programming methods to propose dual-objective mathematical programming models. Their aim was to minimize overall system cost while ensuring the principles conformed to minimization of the maximum delivery time [6]. Most researchers have addressed the problem of the transport and dispatch of relief supplies using quantitative models These studies involved various methods, were comprehensive, and achieved useful results. This study constructs an optimal emergency material dispatch model from multiple depot locations to multiple disaster sites with multiple objectives of the highest reliability and the lowest cost. The study introduces the concept of ideal points and proposes an algorithm to solve the problem

Problem Description
Model Assumptions
Model Construction
Algorithm for Solving the Model
Obtaining Positive and Negative Ideal Points of the Objective Function
Algorithm Procedures
Numerical Examples
Conclusions
Full Text
Paper version not known

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