IMPLEMENTATION OF DIJKSTRA'S ALGORITHM IN DETERMINING THE SHORTEST PATH (CASE STUDY: SPECIALIST DOCTOR SEARCH IN BANDAR LAMPUNG)

Rakhmat Dedi Gunawan; Riduwan Napianto; Rohmat Indra Borman; Irma Hanifah

doi:10.56327/ijiscs.v3i3.768

IMPLEMENTATION OF DIJKSTRA'S ALGORITHM IN DETERMINING THE SHORTEST PATH (CASE STUDY: SPECIALIST DOCTOR SEARCH IN BANDAR LAMPUNG)

Rakhmat Dedi Gunawan⁽¹⁾, Riduwan Napianto⁽²⁾, Rohmat Indra Borman⁽³⁾, Irma Hanifah⁽⁴⁾,

(1)
(2)
(3) Universitas Teknokrat Indonesia
(4)

Corresponding Author

Abstract

The shortest route from a trip will shorten the travel time. Likewise, in the case of the search for specialists. In the search for a specialist the community must come to the health service to ask for specialist information needed. The shortest path is a problem to find the path between two or more vertices in the minimum numbered weighted graph. To make it easier to solve the shortest path problems, a search algorithm is needed. The algorithm that is commonly used in solving problems in finding the shortest path or path is Dijkstra's algorithm. The basic idea of Dijkstra's own algorithm is to find the cost value closest to the destination that functions in a weighted graph. In this study, the Dijkstra algorithm finds the shortest path based on the smallest weight from one point to another, so that it can help provide path choices. Based on the trial of Dijkstra's algorithm, it has the ability to find the shortest path, because in the algorithm each graph is selected the side with the minimum weight that connects a selected node with another node that has not been selected.

References

X. Z. Wang, "The Comparison of Three Algorithms in Shortest Path Issue," Journal of Physics Conference Series, vol. 1087, no. 2, 2018.

S. Andayani and E. W. Perwitasari, "Penentuan Rute Terpendek Pengambilan Sampah di Kota Merauke Menggunakan Algoritma Dijkstra," in Seminar Nasional Teknologi Informasi & Komunikasi Terapan, Semarang, 2014, pp. 164-170.

F. E. Andiany and W. Hadikurniawati, "Implementasi Algoritma Dijkstra Untuk Mencari Rute Terpendek Antar Kantor Dan Estimasi Penggunaan Bahan Bakar Kendaraan (Studi Kasus PT. Telkom Indonesia Regional IV Jateng-DIY)," in Prosiding SENDI_U 2018, 2018, pp. 238-243.

E. Ismantohadi and I. Iryanto, "Penerapan Algoritma Dijkstra Untuk Penentuan Jalur Terbaik Evakuasi Tsunami – Studi Kasus: Kelurahan Sanur Bali," Jurnal Teknologi Terapan, vol. 4, no. 2, pp. 72-78, 2018.

H. Sulistiani and D. A. Wibowo, "Perbandingan Algoritma A* dan Dijsktra dalam Pencarian Kecamatan dan Kelurahan di Bandar Lampung," in Konferensi Nasional Sistem Informasi, Pangkal Pinang, 2018, pp. 423-428.

J Sauwani S., V. N. Putra S., and H. Agung S., "Implementasi Algoritma Djikstra Untuk Menentukan Lokasi dan Jarak Tempuh Terpendek Kampus IT di Jakarta," JURNAL INFORMATIKA, vol. 6, no. 1, pp. 29-36, 2019.

G. Deepa, P. Kumar, A. Manimaran, K. Rajakumar, and V. Krishnamoorthy, "Dijkstra Algorithm Application: Shortest Distance between Buildings," International Journal of Engineering & Technology, vol. 7, no. 4.10, 2018.

K. Magzhan and H. M. Jani, "A Review And Evaluations Of Shortest Path Algorithms," INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH, vol. 2, no. 6, 2013.

N. A. Ojekudo and N. P. Akpan, "Anapplication of Dijkstra’s Algorithm to shortest route problem," IOSR Journal of Mathematics (IOSR-JM) , vol. 13, no. 3, 2017.

D. Wahyuningsih and E. Syahreza, "Shortest Path Search Futsal Field Location With Dijkstra," IJCCS (Indonesian Journal of Computing and Cybernetics Systems), vol. 12, no. 2, 2018.

M. K. Harahap and N. Khairina, "Pencarian Jalur Terpendek dengan Algoritma Dijkstra," Jurnal & Penelitian Teknik Informatika, vol. 2, no. 2, pp. 18-23, 2017.

U. M. Rifanti, "Pemilihan Rute Terbaik Menggunakan Algoritma Dijkstra Untuk Mengurangi Kemacetan Lalu Lintas Di Purwokerto," Jurnal Matematika dan Pendidikan Matematika, vol. 2, no. 2, pp. 90-99, 2017.

S. Nandiroh, H. Haryanto, and H. Munawir, "Implementasi Algoritma Dijkstra Sebagai Solusi Efektif Pembuatan Sistem Bantuan Bencana Real Time," Jurnal Ilmiah Teknik Industri, vol. 12, no. 2, pp. 223-234, 2013.

M. S. Yusuf, H. M. Az-Zahra, and D. H. Apriyanti, "Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Lokasi Pengguna Ke Tanaman Yang Di Tuju Berbasis Android (Studi Kasus di Kebun Raya Purwodadi)," Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 1, no. 12, pp. 1779-1787, 2017.

R. Munir, Matematika Diskrit Edisi Ketiga. Bandung: Informatika, 2009.

R. Saputra, "Sistem Informasi Pencarian Obyek Kota Medan Dengan Algoritma Dijkstra," Jurnal Matematika, vol. 1, no. 14, pp. 19-24, 2011.

D. Ardana and R. Saputra, "Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang," in Seminar Nasional Ilmu Komputer (SNIK), Semarang, 2016, pp. 299-306.

H. T. Hidayat, "Sistem Penunjang Keputusan Pencarian Jarak Terpendek Menuju Rumah Sakit Dan Puskesmas Dengan Metode Dijkstra," TECHSI : Jurnal Penelitian Teknik Informatika, vol. 8, no. 1, 2016.

J. J. Siang, Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta: Andi Offset, 2009.

K. Pindrayana, R. I. Borman, B. Prasetyo, and S. Samsugi, "Prototipe Pemandu Parkir Mobil Dengan Output Suara Manusia Mengunakan Mikrokontroler Arduino Uno," CIRCUIT: Jurnal Ilmiah Pendidikan Teknik Elektro, vol. 2, no. 2, pp. 71-82, 2018.

A. Hendini, "Pemodelan Uml Sistem Informasi Monitoring Penjualan Dan Stok Barang (Studi Kasus: Distro Zhezha Pontianak)," JURNAL KHATULISTIWA INFORMATIKA, vol. IV, no. 2, pp. 107-116, 2016.

Full Text: PDF