IMPLEMENTASI ALGORITMA DJIKSTRA MENENTUKAN JARAK TERDEKAT JELAMBAR KAMPUS STMIK NUSA MANDIRI CENGKARENG
DOI:
https://doi.org/10.58487/akrabjuara.v7i1.1757Keywords:
Djikstra Algorithm, implementation, Fastest routeAbstract
Traffic jams in Jakarta have become our daily sight. There are many steps that have been taken by the government to solve congestion in Jakarta. However, traffic jams still occur today. The high mobility of road users is often constrained by the lack of limited road facilities and infrastructure. Therefore, road users must find their own way to solve this problem. That is, one of the most effective and efficient ways is to find an alternative route or route for the shortest distance that can be traversed using the Djikstra Algorithm. So that the journey from the Jelambar area to the STMIK NUSA MANDIRI Cengkareng campus can be passed quickly without being blocked by traffic jams. The use of the Djikstra Algorithm can provide a solution because the Djikstra Algorithm provides output in the form of the fastest and shortest path from the place of origin to our destination.
Downloads
References
Ardyan, S., Suyitno, A., & Mulyono. (2017). Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten. UNNES Journal of Mathematics, 6(2), 108–116.
Fauzi, I. (2011). PENGGUNAAN ALGORITMA DIJKSTRA DALAM PENCARIAN RUTE TERCEPAT DAN RUTE TERPENDEK (Studi Kasus Pada Jalan Raya antara Wilayah Blok M dan Kota). Tugas Akhir, 1–210.
Fitria, & Triansyah, A. (2013). Implementasi Algoritma Dijkstra Dalam Aplikasi Untuk Menentukan Lintasan Terpendek Jalan Darat Antar Kota Di Sumatera Bagian Selatan. Jurnal Sistem Informasi (JIS), 5(2), 611–621. http://ejournal.unsri.ac.id/index.php/jsi/article/download/840/430
Hariyadi, D., Nakulo, B., Sari, I. D., & Aini, F. N. (2020). Indonesian Journal of Business Intelligence. Indonesian Journal of Business Intelligence, 3(1), 14–19.
Noviriandini, A., & Safitri, M. (2017). Implementasi Algoritma Dijkstra Untuk Menentukan Jalur Terpendek Wilayah Pisangan Dan Kampus Nusa Mandiri Tangerang. 13(2), 181–186.
R, W. E. Y., Istiadi, D., & Roqib, A. (2015). Pencarian Spbu Terdekat Dan Penentuan Jarak Terpendek Menggunakan Algoritma Dijkstra. Jurnal Nasional Teknik Elektro, 4(1), 89–93.
Salaki, D. T. (2011). Penentuan Lintasan Terpendek Dari Fmipa Ke Rektorat Dan Fakultas Lain Di Unsrat Manado Menggunakan Algoritma Djikstra. Jurnal Ilmiah Sains, 11(1), 73. https://doi.org/10.35799/jis.11.1.2011.46
Sulindawaty, Winata, H., & Syahputra, T. (2015). PENDISTRIBUSIAN BARANG FARMASI MENGGUNAKAN ALGORITMA DIJKSTRA (STUDI KASUS?: PT. AIR MAS CHEMICAL). Jurnal Ilmiah Saintikom Sains Dan Komputer, 14(6), 8.
