PENERAPAN ALGORITMA DIJKSTRA DALAM PENENTUAN LINTASAN TERPENDEK MENUJU UPT. PUSKESMAS CILODONG KOTA DEPOK

Cicih Sri Rahayu, Windu Gata, Sri Rahayu, Agus Salim, Arif Budiarto

Abstract


One of the government's efforts in providing health to the community is the construction of health centers in each sub-district, and the community is expected to be able to take advantage of the health facilities provided by the government. One of the problems that exist in the community is determining the shortest distance to the puskesmas. In Depok City, there are 26 routes that can be passed from the 38 nodes or vertices to the Cilodong Health Center with the starting point of the Depok mayor's office. This study uses a survey research method to calculate the actual distance at each node or vertex, the purpose of this study is to determine the shortest path taken by the starting point from the Depok mayor's office to get to the Cilodong Health Center by applying the dijkstra algorithm. This dijkstra algorithm works by visiting all existing points and making a route if there are 2 routes to the same 1 point then the route that has the lowest weight is chosen so that all points have an optimal route. This quest continues until the final destination point. After doing this research and testing using a simple application to calculate the distance by applying the djikstra algorithm, it was found that the shortest path taken to the destination is through the GDC Main Gate or on the test results in Iteration 26. From the results of this study, people can choose this closest route to save time when viewed from the distance of the existing track. For further research, it is expected to be able to compare two other algorithms and other parameters so that the closest route with the fastest time is obtained.


Keywords


Dijkstra's Algorithm; Trajectory; Puskesmas

Full Text:

PDF

References


S. Irmawati, “KUALITAS PELAYANAN KESEHATAN DI PUSKESMAS SANGURARA KECAMATAN TATANGA KOTA PALU,” J. Katalogis, vol. 5, no. 1, pp. 188–197, 2017.

M. K. Harahap, “Pencarian Jalur Terpendek dengan Algoritma Dijkstra,” J. Penelit. Tek. Inform., vol. 2, pp. 18–23, 2019.

S. Kirono, M. I. Arifianto, R. E. Putra, A. Musoleh, and R. Setiadi, “Graph-based modeling and dijkstra algorithm for searching vehicle routes on highways,” Int. J. Mech. Eng. Technol., vol. 9, no. 8, pp. 1273–1280, 2018.

B. Amaliah, C. Fatichah, and O. Riptianingdyah, “Finding the shortest paths among cities in Java Island using node combination based on Dijkstra algorithm,” Int. J. Smart Sens. Intell. Syst., vol. 9, no. 4, pp. 2219–2236, 2016, doi: 10.21307/ijssis-2017-961.

E. Ismantohadi and I. Iryanto, “Penerapan Algoritma Dijkstra untuk Penentuan Jalur Terbaik Evakuasi Tsunami – Studi Kasus: Kelurahan Sanur Bali,” JTT (Jurnal Teknologi Terapan), vol. 4, no. 2. 2018, doi: 10.31884/jtt.v4i2.79.

S. Ardyan, A. Suyitno, and Mulyono, “Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten,” UNNES J. Math., vol. 6, no. 2, pp. 108–116, 2017.

Ferdiansyah and R. Ahmad, “Penerapan Kabupaten Tangerang,” J. TICOM, vol. 2, no. 1, pp. 51–57, 2013.

S. Nandiroh and H. Munawir, “Implementasi Algoritma Dijkstra Sebagai Solusi Efektif Pembuatan Sistem Bantuan,” J. Ilm. Tek. Ind., vol. 12, no. 29, pp. 223–234, 2019.Algoritma Dijkstra untuk Menentukan Rute Terpendek Pembacaan Water Meter Induk PDAM Tirta Kerta Raharja

U. M. Rifanti, “Pemilihan Rute Terbaik Menggunakan Algoritma Dijkstra Untuk Mengurangi Kemacetan Lalu Lintas di Purwokerto,” JMPM J. Mat. dan Pendidik. Mat., vol. 2, no. 2, p. 90, 2017, doi: 10.26594/jmpm.v2i2.926.

Fitria and Apri Triansyah, “Implementasi Algoritma Dijkstra Dalam Aplikasi Untuk Menentukan Lintasan Terpendek Jalan Antar Kota Disumatra Bagian Selatan,” Kntia, vol. 5, no. 2, pp. 1–7, 2011, [Online]. Available: http://www.scribd.com/doc/16342804/Corel-Draw-12.

E. Kusuma and H. Agung, “Aplikasi Perhitungan Dan Visualisasi Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek,” J. Sisfokom, vol. 08, no. 1, pp. 14–23, 2019.

C. S. Rahayu, “PENERAPAN ALGORITMA DIKSTRA DALAM PENENTUAN LINTASAN TERPENDEK MENUJU UPT. PUSKESMAS CILODONG KOTA DEPOK,” 2020.




DOI: https://doi.org/10.15408/jti.v14i1.18721 Abstract - 0 PDF - 0

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Cicih Sri Rahayu, Windu Gata, Sri Rahayu, Agus Salim, Arif Budiarto

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

3rd Floor, Dept. of Informatics, Faculty of Science and Technology, UIN Syarif Hidayatullah Jakarta
Jl. Ir. H. Juanda No.95, Cempaka Putih, Ciputat Timur.
Kota Tangerang Selatan, Banten 15412
Tlp/Fax: +62 21 74019 25/ +62 749 3315
Handphone: +62 8128947537
E-mail: jurnal-ti@apps.uinjkt.ac.id


Creative Commons Licence
Jurnal Teknik Informatika by Prodi Teknik Informatika Universitas Islam Negeri Syarif Hidayatullah Jakarta is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Based on a work at http://journal.uinjkt.ac.id/index.php/ti.

JTI Visitor Counter: View JTI Stats

 Flag Counter