Planning Evacuation Routes in Rise Buildings Using Maximum Dynamic Flow Approach
Khusnul Novianingsih, Beriel Ilham, Kartika Yulianti, Sumanang M. Gozali

Mathematics Study Program, Universitas Pendidikan Indonesia

Abstract

Planning evacuation route is one important aspect in disaster management. This research studies a problem to determine optimal evacuation routes in rise buildings. We model the problem to maximize the number of evacuees need to move towards the assembly points in a short period of time. Using maximum dynamic flow 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 flow distribution is repeated along the chain of the static network for each time unit. We test our model to analyze evacuation route plans in building of FPMIPA A UPI. The results show that the evacuation process will end in 6 seconds and it can evacuate about 2364 evacuees. Thus, it can be concluded that the building of FPMIPA A UPI has a good structure in supporting the evacuation process when a disaster occurs.

Keywords: Evacuation Route, Maximum Dynamic Flow Problem, Network, Temporally Repeated Flow

Topic: Mathematic