Emergency Route Planning with the Shortest Path Methods: Static and Dynamic Obstacles

• Published in: International journal of simulation modelling Vol. 21; no. 3; pp. 429 - 440
• Main Authors: Ibrahim, N., Hassan, F. H., Ab Wahab, M. N., Letchmunan, S.
• Format: Journal Article
• Language: English
• Published: Vienna DAAAM International Vienna 01.09.2022
• Subjects: Barriers; Casualties; Cellular automata; Dijkstra's algorithm; Emergency exits; Evacuation; Layouts; Route planning; Shortest path planning
• ISSN: 1726-4529; 1726-4529
• DOI: 10.2507/IJSIMM21-3-608

In extreme cases, evacuation difficulties could cause casualties in a closed layout during an emergency. The existing emergency routes are designed based on the shortest path to the nearest egress in a vacant layout. This research aims to design an emergency route plan in a realistic closed layout with interior arrangements and crowds as static and dynamic impediments that cause movement divergence and misdirection that affect evacuation time. This research proposes an automated emergency route design using Cellular Automata (CA) based pedestrian simulation in a realistic layout. The simulation was integrated with the Pythagorean Theorem (PT) and Dijkstra's Algorithm (DA) to imitate human exit-finding behaviour during evacuation. The results showed that PT is viable in layouts with static obstacles, requiring 20 % less travel distances and evacuation time than DA with similar experiment sets. However, the DA approach results have become on par with the PT in a layout with dynamic and static obstacles. DA outperforms PT in densely populated regions, while PT outperforms DA in less populated regions.