SIPAMBULAN: Sistem Informasi Pelayanan Ambulan menggunakan Algoritma Djikstra

Abstract views: 23 , PDF downloads: 19
Keywords: djikstra, extreme programming, system usability scale

Abstract

The rapid development of information technology encourages innovation in various fields, including the field of disaster geographic information services. Lack of information on ambulance service providers is often the cause of delays in handling victims of natural disasters. Besides, the absence of information regarding the nearest route for ambulances to emergency service providers such as health centers and hospitals adds to the length of time for handling victims of natural disasters, resulting in increasingly severe victim losses, including life. This study aims to create a geographic information system that can be used to provide information on the location of the nearest ambulance service provider and emergency unit service. The system development research method uses the extreme programming method by implementing the Djikstra algorithm to determine the shortest route. This system testing process consists of testing the Djikstra algorithm and testing functionality using a usability scale. Djikstra's algorithm testing is done by comparing the results of calculating the shortest route for two location points with the results obtained when using the Google Maps application. The results of this test indicate that the system can display shorter routes than the routes generated by the Google Maps application. On the other hand, testing system functionality using the usability scale method to see system acceptance by users shows that the application can be used properly with a score obtained that is 77.

References

B. P. Statistik and K. Cilacap, “Statistik Daerah,” 2020.

V. Suci, “Aplikasi Pencarian Jalur Terdekat Panggilan Darurat Supir Ambulans Kota Medan Menggunakan Algoritma Boruvka Berbasis Android,” Inf. dan Teknol. Ilm., vol. 8, no. 1, pp. 20–24, 2020, [Online]. Available: http://ejurnal.stmik-budidarma.ac.id/index.php/inti/article/view/2786

R. Dewi, A. Suprayogi, and B. Sasmito, “Aplikasi Pgrouting Untuk Penentuan Jalur Optimum Ambulan Dalam Proses Mobilisasi Korban Kecelakaan Lalu Lintas Menuju Unit Gawat Darurat Berbasis Desktop (Studi Kasus : Kota Semarang),” J. Geod. Undip, vol. 4, no. 4, pp. 118–125, 2015.

M. K. Harahap and N. Khairina, “Pencarian Jalur Terpendek dengan Algoritma Dijkstra,” SinkrOn, vol. 2, no. 2, p. 18, 2017, doi: 10.33395/sinkron.v2i2.61.

D. Ardana and R. Saputra, “Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang,” Skripsi Jur. Ilmu Komputer, Fak. Sains Dan Mat. Univ. Diponegoro, no. Snik, pp. 299–306, 2016.

A. G. Rumondor, S. R. Sentinuwo, A. M. Sambul, T. Elektro, U. Sam, and J. K. B. Manado, “Perancangan Jalur Terpendek Evakuasi Bencana di Kawasan Boulevard Manado Menggunakan Algoritma Dijkstra,” J. Tek. Inform., vol. 14, no. 2, pp. 261–268, 2019.

A. Sedeño-noda and M. Colebrook, “A biobjective Dijkstra algorithm,” Eur. J. Oper. Res., vol. 276, no. 1, pp. 106–118, 2019, doi: 10.1016/j.ejor.2019.01.007.

R. Ridlo, A. Hakim, Y. Z. Arief, A. Pangestu, and A. Jaenul, “Penggunaan Algoritma Dijkstra untuk Berbagai Masalah: Mini Review Insulation via vege based oil View project,” Artif. Intell. (JGU Thesis), no. May, pp. 1–10, 2021, doi: 10.13140/RG.2.2.21389.05602/1.

L. M. S. Bento, D. R. Boccardo, R. C. S. Machado, F. K. Miyazawa, V. G. Pereira de Sá, and J. L. Szwarcfiter, “Dijkstra graphs,” Discret. Appl. Math., vol. 261, pp. 52–62, 2019, doi: 10.1016/j.dam.2017.07.033.

Y. Anshori, A. Y. E. Dodu, and F. Kurniawan, “Perancangan Robot Penelusur Menggunakan Algoritma Dijkstra dan Metode Maze Solver,” Techno.Com, vol. 18, no. 2, pp. 166–177, 2019, doi: 10.33633/tc.v18i2.2335.

Z. H. Hayati, A. Hasanuddin, and P. P. Putra, “Analisis Rute Ambulan Desa Menuju UGD Berdasarkan Waktu Tempuh Perjalanan Menggunakan SIG di Kabupaten Jember,” J. Ilm. Rekayasa Sipil, vol. 17, no. 2, pp. 180–191, 2020, doi: 10.30630/jirs.12.2.378.

R. Satria, Royana Afwani, and Sri Endang Anjarwani, “Rancang Bangun Sistem Informasi Geografis Untuk Pemetaan Lokasi Tempat Ibadah Di Kota Mataram Menggunakan Metode Extreme Programming,” J. Comput. Sci. Informatics Eng., vol. 5, no. 2, pp. 111–119, 2021, doi: 10.29303/jcosine.v5i2.395.

A. Supriyatna, “Metode Extreme Programming Pada Pembangunan Web Aplikasi Seleksi Peserta Pelatihan Kerja,” J. Tek. Inform., vol. 11, no. 1, pp. 1–18, 2018, doi: 10.15408/jti.v11i1.6628.

V. H. Pranatawijaya, “Penerapan Location Based Serviced (Lbs) Dalam Prototipe Pengenalan Ruangan Dengan Metode Extreme Programming,” J. Teknol. Inf. J. Keilmuan dan Apl. Bid. Tek. Inform., vol. 15, no. 1, pp. 92–99, 2021, doi: 10.47111/jti.v15i1.1936.

N. H. Adi, M. Giatman, W. Simatupang, A. Afrina, and R. Watrianthos, “Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek,” Build. Informatics, Technol. Sci., vol. 3, no. 3, pp. 235–243, 2021, doi: 10.47065/bits.v3i3.1052.

R. R. Al Hakim et al., “Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah,” Expert J. Manaj. Sist. Inf. dan Teknol., vol. 11, no. 1, p. 42, 2021, doi: 10.36448/expert.v11i1.1939.

D. Wahyuningsih and E. Syahreza, “Shortest Path Search Futsal Field Location With Dijkstra Algorithm,” IJCCS (Indonesian J. Comput. Cybern. Syst., vol. 12, no. 2, p. 161, 2018, doi: 10.22146/ijccs.34513.

I. Salamah, “Evaluasi Usability Website Polri Dengan Menggunakan System Usability Scale,” J. Nas. Pendidik. Tek. Inform. JANAPATI, vol. 8, no. 3, pp. 176–183, 2019, [Online]. Available: www.polsri.ac.id.

D. Supriyadi, S. Thya Safitri, and D. Y. Kristiyanto, “Higher Education e-Learning Usability Analysis Using System Usability Scale,” Int. J. Inf. Syst. Technol. Akreditasi, vol. 4, no. 1, pp. 436–446, 2020.

PlumX Metrics

Published
2023-01-09