Planning Evacuation Routes in Rise Buildings Using Maximum Dynamic Flow Approach
- DOI
- 10.2991/978-2-38476-283-5_14How to use a DOI?
- Keywords
- Evacuation route; maximum dynamic flow problem; network; temporally repeated flow
- Abstract
Planning evacuation route is one important aspect in disaster management. This research study a problem to determine optimal evacuation routes in rise buildings. we model a problem to maximize the number of people that must be evacuated from several points to some assembly points in a short period of time using maximum dynamic ow approach. The evacuation routes are determined using Temporally Repeated Flows approach based on the Maximum Dynamic Flow Problems. By representing the building as a static network, the shortest routes are calculated from each source node to the destination nodes. Then, the ow distribution is repeated along the chain of the static network for each time unit. We test our model to construct evacuation route plans in the building of Faculty of Mathematics and Natural Sciences Education (Main Builiding) Universitas Pendidikan Indonesia. The results show that the model produces evacuation routes that can be maximize the number of evacuees in short time. Thus, it can be concluded that the building has a good structure in supporting the evacuation process when a disaster occurs.
- Copyright
- © 2024 The Author(s)
- Open Access
- Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
Cite this article
TY - CONF AU - Khusnul Novianingsih AU - Beriel Ilham AU - Kartika Yulianti AU - Sumanang M. Gozali PY - 2024 DA - 2024/09/03 TI - Planning Evacuation Routes in Rise Buildings Using Maximum Dynamic Flow Approach BT - Proceedings of the 9th Mathematics, Science, and Computer Science Education International Seminar (MSCEIS 2023) PB - Atlantis Press SP - 142 EP - 148 SN - 2352-5398 UR - https://doi.org/10.2991/978-2-38476-283-5_14 DO - 10.2991/978-2-38476-283-5_14 ID - Novianingsih2024 ER -