TY - JOUR
T1 - Congestion-aware Evacuation Shelter Selection Method Through Iterations of Evacuation Simulations with Dynamic Congestion Reproduction
AU - Umeki, Kazuhito
AU - Tanaka, Tomoki
AU - Nakamura, Yugo
AU - Fujimoto, Manato
AU - Mizumoto, Teruhiro
AU - Suwa, Hirohiko
AU - Arakawa, Yutaka
AU - Yasumoto, Keiichi
N1 - Publisher Copyright:
Author
PY - 2022
Y1 - 2022
N2 - It is necessary to optimize evacuation guidance to shelters in short evacuation time. The state-of-the-art method based on an idea of combinatorial optimization problems related to evacuees’ locations and the capacities of nearby shelters has been developed, while it cannot mitigate the effect of congestion on roads/streets after evacuation starts. In this study, to cover this problem, we develop a new method that utilizes simulations for estimating the effect of congestion on roads/streets during evacuation and reassigning shelters to evacuees based on the simulation results. By iterating this step, our method derives the congestion-aware solutions for shelter selection that can realize more smooth evacuation. To evaluate our method, we conducted multi-agent simulations assuming a disaster situation in a sightseeing spot. Specifically, we examined a hypothetical case scenario involving the evacuation of 30,000 visitors from the Gion Festival. We compared the proposed method with conventional methods, such as the nearest shelter selection method and our previous method. We found that our proposed method reduced average and total evacuation time and congestion on roads compared to the conventional methods including the nearest shelter selection method and our previous method that only employs combinatorial optimization without estimating congestion. From this result, our idea of simulation-based congestion estimation has an impact of easing congestion during evacuation and preventing overcapacity of shelters at the same time. It shows the possibilities of help in developing congestion-aware evacuation strategies in emergency situations of crowded areas like huge cities or sightseeing spots.
AB - It is necessary to optimize evacuation guidance to shelters in short evacuation time. The state-of-the-art method based on an idea of combinatorial optimization problems related to evacuees’ locations and the capacities of nearby shelters has been developed, while it cannot mitigate the effect of congestion on roads/streets after evacuation starts. In this study, to cover this problem, we develop a new method that utilizes simulations for estimating the effect of congestion on roads/streets during evacuation and reassigning shelters to evacuees based on the simulation results. By iterating this step, our method derives the congestion-aware solutions for shelter selection that can realize more smooth evacuation. To evaluate our method, we conducted multi-agent simulations assuming a disaster situation in a sightseeing spot. Specifically, we examined a hypothetical case scenario involving the evacuation of 30,000 visitors from the Gion Festival. We compared the proposed method with conventional methods, such as the nearest shelter selection method and our previous method. We found that our proposed method reduced average and total evacuation time and congestion on roads compared to the conventional methods including the nearest shelter selection method and our previous method that only employs combinatorial optimization without estimating congestion. From this result, our idea of simulation-based congestion estimation has an impact of easing congestion during evacuation and preventing overcapacity of shelters at the same time. It shows the possibilities of help in developing congestion-aware evacuation strategies in emergency situations of crowded areas like huge cities or sightseeing spots.
UR - http://www.scopus.com/inward/record.url?scp=85137573157&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85137573157&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2022.3194874
DO - 10.1109/ACCESS.2022.3194874
M3 - Article
AN - SCOPUS:85137573157
SN - 2169-3536
VL - 10
SP - 1
JO - IEEE Access
JF - IEEE Access
ER -