The Utilisation of Dijkstra's Algorithm to Assist Evacuation Route in Higher and Close Building
- 1 Universiti Teknikal Malaysia Melaka, Malaysia
Copyright: © 2020 Nor Amalina Mohd Sabri, Abd Samad Hasan Basari, Burairah Husin and Khyrina Airin Fariza Abu Samah. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Finding a shortest path in a high rise building during critical incident or evacuation is facing two main issues which are evacuees find difficulties to find the best routes and their behavior makes the process more difficult. These problems are important since it is related to the human's life. By providing the shortest path and control the evacuee behavior, these can lead to successfulness of evacuation. To overcome these issues, two main objectives have been carried on which is initiated by identifying the shortest path algorithm for evacuation. Then follows by design and develop an evacuation preparedness model via shortest path algorithm to choose a suitable exit route to evacuate. Three steps are involved to achieve the objectives. The first step is Building Layout Plan, followed by creating the Visibility Graph and finally implements Dijkstra Algorithm to find the shortest path. Based on the experimental study, the result shows that Dijkstra Algorithm has produced a significant route to exit the building safely. Even though there are other factors need to be considered, this preliminary result has shown a promising outcome which can be extended to improve the robustness of the algorithm. In conclusion, the obtained shortest path is believed can assist evacuee to choose a suitable exit route to evacuate safely.
- 992 Views
- 1,240 Downloads
- 3 Citations
- Critical Incident
- Dijkstra Algorithm
- Shortest Path