Designing Evacuation Route Using DIJKSTRA Methods

I Nyoman Yudha Astana, I Dewa Ketut Sudarsana, Ni Made Widya Puspa

Abstract


The safety of building occupants is a top priority while a disaster, for this reason, the availability of evacuation facilities and evacuation route maps is something that must be considered. To avoid the risks that occurred by disasters, the researchers designed an evacuation route using Dijkstra's Algorithm method. In designing the evacuation route, an effective route should be chosen so evacuation can be carried out quickly. To determine the travel time required data speed and distance to the assembly point, so the travel time of each route, then the fastest route is selected. From the design outputs, the location of the assembly point is determined on the top page. Knowing the fastest route, then an evacuation route map is made so that school building users more easily to get the assembly point.


Keywords


Evacuation Capacity, Evacuation Time, Dijkstra's Algorithm

Full Text:

PDF

References


K. F. SIGARLAKI and M. Febrianne, “Jalur Evakuasi Bencana Pada Gedung Pusat Politeknik Negeri Manado,” J. Tek. Sipil Terap., vol. 3, no. 3, pp. 111–120, 2021.

A. Prabowo and J. Supratman, “Evacuation Route Map With Djikstra Algorithm in,” vol. 02, no. 02, pp. 8–14, 2020.

M. H. Nugroho, Y. Arnandha, and A. Rakhmawati, “ANALISIS PETA JALUR EVAKUASI DAN PENENTUAN TITIK KUMPUL DENGAN METODE ALGORITMA DIJKSTRA (STUDI KASUS: GEDUNG UNIVERSITAS TIDAR KAMPUS TUGURAN),” J. Rekayasa Infrastruktur Sipil, vol. 1, no. 2, pp. 3–8, 2021.

M. H. Nugroho, Y. Arnandha, and A. Rakhmawati, “Analisis Peta Jalur Evakuasi Dan Penentuan Titik Kumpul Dengan Metode Algoritma Dijkstra(Studi Kasus: Gedung Universitas Tidar Kampus Tuguran),” J. Rekayasa Infrastruktur Sipil, vol. 1, no. 2, pp. 3–8, 2021.

M. K. Harahap and N. Khairina, “Pencarian Jalur Terpendek Dengan Algoritma Dijkstra,” J. Penelit. Tek. Inform. Sink., vol. 2, no. 2, 2017.

I. G. S. Rahayuda and N. P. L. Santiari, “Dijkstra and Bidirectional Dijkstra on Determining Evacuation Routes,” J. Phys. Conf. Ser., vol. 1803, no. 1, 2021.

A. Wijaya, Matematika Diskrit. Politeknik Telkom, 2009.

H. P. Rahayu and J. Anita, “Perencanaan Tempat Evakuasi Sementara (TES) Tsunami.” pp. 1–112, 2013.

T. Shen, “Building Planning Evaluations for Emergency Evacuation,” J. Appl. Fire Sci., vol. 12, no. 1, pp. 1–22, 2005.

L. N. Dewi, R. W. Damayanti, and I. Iftadi, “Perancangan Jalur Evakuasi Kebakaran Fakultas ABC Universitas X sesuai ISO 7010 dengan Metode Algoritma Dijkstra,” 2017.

I. Baharudin, A. J. Purwanto, T. R. Budiman, and M. Fauzi, “IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN JALUR TERPENDEK DALAM DISTRIBUSI BARANG,” J. Lebesgue, vol. 2, no. 2, pp. 194–203, 2021.

A. Pratama, “PERANCANGAN SARANA PENYELAMAT DIRI DAN KEBUTUHAN APAR PADA DARURAT KEBAKARAN DI KANTOR KESEHATAN PELABUHAN KELAS II BALIKPAPAN,” Indones. J. Occup. Saf. Heal., vol. 5, no. 1, pp. 21–30, 2016.

Y. Zhu et al., “Optimal Evacuation Route Planning of Urban Personnel at Different Risk Levels of Flood Disasters Based on the Improved 3D Dijkstra’s Algorithm,” Sustain., vol. 14, no. 16, 2022.

K. A. F. A. Samah, B. Hussin, and A. S. H. Basari, “Modification of Dijkstra’s algorithm for safest and shortest path during emergency evacuation,” Appl. Math. Sci., vol. 9, no. 29–32, pp. 1531–1541, 2015.




DOI: http://dx.doi.org/10.52155/ijpsat.v37.2.5172

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 I Nyoman Yudha Astana, I Dewa Ketut Sudarsana, Ni Made Widya Puspa

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.