Author:
Takizawa Atsushi,Kawagishi Yutaka
Abstract
AbstractWhen a disaster such as a large earthquake occurs, the resulting breakdown in public transportation leaves urban areas with many people who are struggling to return home. With people from various surrounding areas gathered in the city, unusually heavy congestion may occur on the roads when the commuters start to return home all at once on foot. In this chapter, it is assumed that a large earthquake caused by the Nankai Trough occurs at 2 p.m. on a weekday in Osaka City, where there are many commuters. We then assume a scenario in which evacuation from a resulting tsunami is carried out in the flooded area and people return home on foot in the other areas. At this time, evacuation and returning-home routes with the shortest possible travel times are obtained by solving the evacuation planning problem. However, the road network big data for Osaka City make such optimization difficult. Therefore, we propose methods for simplifying the large network while keeping those properties necessary for solving the optimization problem and then recovering the network. The obtained routes are then verified by large-scale pedestrian simulation, and the effect of the optimization is verified.
Reference20 articles.
1. L.R. Ford, D.R. Fulkerson, Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419–433 (1958). https://doi.org/10.1287/opre.6.3.419
2. L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, 1962)
3. U. Hiroi, T. Oomori, H. Shinkai, Evacuation simulation in metropolitan area and risk maps of heavy traffic and crowd in catastrophic disaster. J. Jpn. Assoc. Earthq. Eng. 16(5), 5\_111–5\_126 (2016). https://doi.org/10.5610/jaee.16.5_111
4. B. Hoppe, É. Tardos, Polynomial time algorithms for some evacuation problems, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94) (1994), pp. 433–441
5. B. Hoppe, É. Tardos, The quickest transshipment problem. Math. Oper. Res. 25(1), 36–62 (2000). https://doi.org/10.1287/moor.25.1.36.15211