[1]LI Wenqian,ZHOU Daoyang,ZHENG Yuanyuan.Analysis on Emergency Evacuation Route of the Earthquake Disaster Based on the Dijkstra Algorithm[J].Journal of Seismological Research,2022,45(04):653-661.[doi:10.20015/j.cnki.ISSN1000-0666.2022.0065]
Copy
Journal of Seismological Research[ISSN 1000-0666/CN 53-1062/P] Volume:
45
Number of periods:
2022 04
Page number:
653-661
Column:
Public date:
2022-08-20
- Title:
-
Analysis on Emergency Evacuation Route of the Earthquake Disaster Based on the Dijkstra Algorithm
- Author(s):
-
LI Wenqian1; ZHOU Daoyang2; ZHENG Yuanyuan1
-
(1.School of Economics and Management,Tianjin Chengjian University,Tianjin 300384,China)(2.School of International Education,Tianjin Chengjian University,Tianjin 300384,China)
-
- Keywords:
-
earthquake disaster; emergency evacuation; evacuation behavior; the Dijkstra algorithm; optimal route; Tianjin Area
- CLC:
-
P315.95
- DOI:
-
10.20015/j.cnki.ISSN1000-0666.2022.0065
- Abstract:
-
In order to avoid the loss of life and property caused by earthquake disasters,it is particularly important to plan the route of urban emergency evacuation in advance.By analyzing the natural and geographical environment of Tianjin City,the spatial distribution characteristics of earthquake disasters in Tianjin and three typical laws of evacuation behavior are both summarized considering human behavior and influencing factors during an earthquake.On the basis of a safe and reasonable selection on emergency shelter and the road network information in the disaster area,the static Dijkstra algorithm and the dynamic Dijkstra algorithm are respectively used to study the optimal evacuation route from one residential community to Changhong Park,an emergency shelter in Tianjin based on the road network information in the disaster area.It is shown in the results that the optimal evacuation route calculated by the static Dijkstra algorithm is exactly the same as the one obtained from the dynamic Dijkstra method,with the length of the shortest route from the residential area to the resettlement site of 3 433 meters and the shortest time of 18.93 minutes.It is indicated that the Dijkstra algorithm can provide the necessary method and application basis for the selection of urban disaster evacuation route and the formulation of emergency plan.