Multiobjective Route Planning Model and Algorithm for Emergency Management

Yan Du,Yun-feng Deng,Jing Li,Wen-mei Gai,Zhong-an Jiang

doi:10.1155/2015/565403

Abstract

In order to model route planning problem for emergency logistics management taking both route timeliness and safety into account, a multiobjective mathematical model is proposed based on the theories of bounded rationality. The route safety is modeled as the product of safety through arcs included in the path. For solving this model, we convert the multiobjective optimization problem into its equivalent deterministic form. We take uncertainty of the weight coefficient for each objective function in actual multiobjective optimization into account. Finally, we develop an easy-to-implement heuristic in order to gain an efficient and feasible solution and its corresponding appropriate vector of weight coefficients quickly. Simulation results show the effectiveness and feasibility of the models and algorithms presented in this paper.

Highlights

In recent years, a number of frequent natural disasters and man-made catastrophic events happen occasionally [1,2,3]
Important or hazardous materials must be transferred from the affected areas to safety areas; even those people at risk in some disasters like gas leak and fire should be evacuated from the affected areas to safety areas
We focus on the route planning problem in emergency logistics management and build a mathematical model to select the optimal route

Summary

Introduction

A number of frequent natural disasters and man-made catastrophic events happen occasionally [1,2,3]. The route safety should be taken into account as an objective of the route planning model for emergency logistics management considering the vulnerability of humans during disaster time. Zhang et al [16] proposed a novel bioinspired method to solve the selection model for emergency logistics management under real-time effect of disaster extension. Both of them first convert two objective functions into a single-objective function by using the weighted-sum method and assume the weighting coefficients as fixed real numbers. The main-objective method is used to define the optimal solution of the multiobjective route planning model By this way, two different heuristic algorithms are designed to solve the proposed model.

Route Planning Model for Emergency

Preliminaries

The Proposed Heuristic Algorithm

Computational Experiments

Results of Model I in Static Environments

Feasible interval of ls

Conclusions