Evacuation Planning for Disaster Management by Using the Relaxation Based Algorithm and Route Choice Model

Dedy Hartama,Eka Irawan,Saifullah Saifullah,Herman Mawengkang,Hartono Hartono,Sumarno Sumarno,Indra Gunawan,Muhammad Zarlis,M Safii,Rahmat Widia Sembiring,Benny Benyamin Nasution,Irfan Sudahri Damanik

doi:10.1007/978-3-030-18293-9_12

Dedy Hartama, Eka Irawan + Show 10 more

Open Access

https://doi.org/10.1007/978-3-030-18293-9_12

Copy DOI

Abstract

Research in the field of disaster management is done by utilizing information and communication technology. Where disaster management is discussed is about evacuation planning issues. The evacuation stage is a very crucial stage in the disaster evacuation process. There have been many methods and algorithms submitted for the evacuation planning process, but no one has directly addressed evacuation planning on dynamic issues concerning time-varying and volume-dependent. This research will use the Relaxation-Based Algorithm combined with the Route Choice Model to produce evacuation models that can be applied to dynamic issues related to time-varying and volume-dependent because some types of disaster will result in damage as time and evacuation paths are volume-dependent so as to adjust to the change in the number of people evacuated. Disaster data that will be used in this research is sourced from Disaster Information Management System sourced from DesInventar. The results of this study are expected to produce an evacuation planning model that can be applied to dynamic problems that take into account the time-varying and volume-dependent aspects.

Highlights

IntroductionDisasters such as floods, earthquakes, hurricanes and terrorist attacks can occur to threaten human life
The research conducted by [2] illustrates a model to minimize the evacuation path time for emergency evacuation. [3] presented a Two Network Flow method using Dijkstra's algorithm to generate an evacuation plan through minimizing the total distance traveled. [4] produced several models that can be applied to evacuation problems in multi-story buildings with an approach that uses the dynamic network flow model
Researchers in this study will use the Relaxation-Based Algorithm combined with the Route Choice Model to produce an evacuation model that minimizes the evacuation time that can be applied to dynamic issues related to time-varying and volume-dependent because some types of disaster will result in damage as time increases and the evacuation route is volume-dependent in order to adapt to changes in the number of people evacuated

Summary

Introduction

Disasters such as floods, earthquakes, hurricanes and terrorist attacks can occur to threaten human life. The research conducted by [2] illustrates a model to minimize the evacuation path time for emergency evacuation. [4] produced several models that can be applied to evacuation problems in multi-story buildings with an approach that uses the dynamic network flow model. [8] proposed an optimal dynamic traffic assignment formulation system to minimize total evacuation time. Some types of disasters will result in damage as time increases and evacuation routes are volume-dependent. Researchers in this study will use the Relaxation-Based Algorithm combined with the Route Choice Model to produce an evacuation model that minimizes the evacuation time that can be applied to dynamic issues related to time-varying and volume-dependent because some types of disaster will result in damage as time increases and the evacuation route is volume-dependent in order to adapt to changes in the number of people evacuated

Evacuation Model With Relaxation-Based Algorithm and Route-Choice Model

Heuristic Algorithm

Lagrangian Relaxation

Relaxation-Based Algorithm

Route Choice Model

Integration between Relaxation Based Algorithm with Route Choice Model

Result and Discussion

Conclusion