Partitioning Vertical Evacuation Areas in Umeda Underground Mall to Minimize the Evacuation Completion Time
- 30 Downloads
When an underground mall is flooded, the shoppers should be evacuated to a building connected to the mall. However, the number of evacuees from a large-scale underground mall will exceed the capacity of the evacuation center. Furthermore, the evacuation time may be delayed. This paper proposes a mathematical programming problem that minimizes the evacuation completion time on a general planar graph of a partitioned evacuation area with a specified sink capacity. We also propose a workflow for translating the general geometric spatial data to graphical data. The problem is applied to the real spatial data and evacuation setting of Umeda underground mall in Osaka, Japan. The problem’s performance is compared with that of the conventional problem that minimizes the total evacuation distance, and its accuracy is confirmed in a multi-agent simulation. The validity of the proposed method is also discussed.
keywordsEvacuation planning Vertical evacuation Umeda underground mall Dynamic tree network Mixed integer programing Multi-agent simulation
This study is partially supported by Grant-in-Aid for Scientific Research (A) and JST CREST innovative algorithm foundation for big data.
- 1.Osaka Prefecture (2013). About the tsunami inundation assumption (commentary). http://www.pref.osaka.lg.jp/attach/31241/00271160/95kaisetu.pdf. Accessed 1 Dec 2018.
- 2.Osaka City Underground Space Infiltration Council (2016). Underground space flood control plan of Osaka station area, ver.1 (reference, latter half). http://www.city.osaka.lg.jp/kikikanrishitsu/cmsfiles/contents/0000259/259323/osakaekitiku-shinsuitaisakukeikaku3.pdf. Accessed 1 Dec 2018.
- 3.Takizawa, A., Takagi, N., & Taniguchi, Y. (2015). Vertical evaluation simulation in Umeda underground mall in case of flooding. Annual Journal of Unban Disaster Reduction Research, 2, 35–38.Google Scholar
- 5.Helbing, D., Farkas, I., Molnar, P., & Vicsek, T. (2001). Simulating of pedestrian crowds in normal and evacuation situations. In M. Schreckenberg & S. D. Sharma (Eds.), Pedestrian and evacuation dynamics (pp. 21–58). Berlin: Springer.Google Scholar
- 7.Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.Google Scholar
- 10.Yang, K. S., Shekhar, A. H., Oliver, D., & Shekhar, S. (2013). Capacity-constrained network-Voronoi diagram: A summary of results. In Advances in Spatial and Temporal Databases—13th International Symposium, pp. 56–73.Google Scholar
- 11.Kamiyama, N., Katoh, N., & Takizawa, A. (2006). An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity. IEICE Transaction on Fundamentals, E89-D(8), 2372–2379.Google Scholar