EMERGENCY PROCESSES HANDLING IN URBAN AREA USING MODIFIED DIJKSTRA METHOD

Prima Wiratama, Ary Mazharuddin Shiddiqi

Abstract


Emergency Aid has a very vital role in saving the patient's life. The emergency process involves two stages, namely the pre-hospital and the hospital stage. Striving for the entire emergency process is to have the fastest response time. The initial part of emergency treatment (pre-hospital) is determining the shortest and fastest route to the hospital. In addition, the availability of the targeted hospital must also be considered. We modified Dijkstra's Algorithm to produce the shortest route and the fastest time by considering the availability of the targeted hospital to support the handling of the emergency process. The modification made to the Dijkstra algorithm replaces the weight of Dijkstra's distance with a quantity representing the congestion rate and distance. Besides, the event time is estimated to determine the status of the intended hospital. As a result, Dijkstra's modification method can produce a more efficient and faster route.


Full Text:

PDF

References


A. S. Nunuk Haryatun, "Perbedaan Waktu Tanggap Tindakan Keperawatan Pasien Cedera Kepala Kategori 1 – V Di Instalasi Gawat Darurat Rsud Dr. Moewardi," Berita Ilmu Keperawatan, 2008.

Permenkes, Keputusan Menteri Kesehatan Republik Indonesia Nomor 856/Menkes/SK/IX/2009, Jakarta: Kementrian Kesehatan RI, 2009.

M. H. H. Ichsan, E. Yudaningtyas, M. A. Muslim, "Solusi Optimal Pencarian Jalur Tercepat dengan Algoritma Hybrid Fuzzy-Dijkstra," Jurnal EECCIS Vol. 6, No. 2, 2012.

K. A. F. A. Samah, B. Hussin, A. S. H. Basari, "Modification of Dijkstra’s Algorithm for Safest and Shortest Path during Emergency Evacuation," Applied Mathematical Sciences, pp. 1531-1541, 2015.

I. C. W. F. M. Prima Wiratama, "Pencarian Rute Terpendek pada Unit Gawat Darurat di Kota Malang dengan Menggunakan Metode Dijkstra," Doro Jurnal, 2016.

B. Amaliah, C. Fatichah, O. Riptianingdyah, "Finding the Shortest Paths among Cities in Java Island using Node Combination based on Dijkstra Algorithm," International Journal on Smart Sensingand Intellegent System, pp. 2219-2236, 2016.

Risald, A. E. Mirino, Suyoto, "Best Route Selection Using Dijkstra And Floyd-Warshall Algorithm," International Conference on Information & Communication Technology and System, pp. 155-158, 2017.

E. W. Dijkstra, "A Note on Two Problemsin Connexionwith Graphs," Numerische Mathematlk, pp. 269-271, 1959.

B. Sukoco, Penentuan Rute Optimal Menuju Lokasi Pelayanan Gawat Darurat Berdasarkan Waktu Tempuh Tercepat (Studi Kasus Kota Surakarta), Surakarta: Jurusan Teknik Industri Fakultas Teknik Universitas Sebelas Maret Surakarta, 2010.




DOI: http://dx.doi.org/10.12962/j24068535.v19i2.a1047

Refbacks

  • There are currently no refbacks.