Penentuan Jalur Alternatif Menghindari Jalan Rawan Macet Di Kota Karawang Menggunakan Algoritma Djikstra
Abstrak
Congestion is one of the society problems, especially in big cities. Congestion occurs because the number of vehicles with width of roads that are not comparable. Therefore an appropriate alternative route selection method is needed to reduce congestion problems. This study aims to determine alternative pathways that are more effective and efficient so as to reduce congestion in certain road segments by determining the smallest weights from each road segmen with Djikstra Algorithm. This research produces several alternative routes that can be used to avoid certain road traffic jams, that people can choose different alternative routes according to their respective goals. The results of this study indicate that Djikstra algorithm can determine the optimal path as an appropriate alternative route to reduce congestion problems in the city of karawang.
Referensi
bps.go.id. (2018). Perkembangan Jumlah Kendaraan Bermotor Menurut Jenis. In Badan Pusat Statistik (pp. 1–1). https://www.bps.go.id/linkTableDinamis/view/id/1133
Gusmão, A., & Pramono, S. H. (2013). Sistem Informasi Geografis Pariwisata Berbasis Web Dan Pencarian Jalur Terpendek Dengan Algoritma Dijkstra. 7(2), 125–130.
Hanif Ilmi Mardlotillah, Amin Suyitno, F. Y. A. (2014). Simulasi Algoritma Dijkstra Dalam Menangani Masalah Lintasan Terpendek Pada Graf Menggunakan Visual Basic. Unnes Journal of Mathematics, 4(2), 3–8.
Hannants, M., Ichsan, H., Yudaningtyas, E., & Muslim, M. A. (2012). Solusi Optimal Pencarian Jalur Tercepat dengan Algoritma Hybrid Fuzzy-Dijkstra. 6(2), 155–160.
Intan Alifianu, Muhamad Aznar Abdillah, I. S. (2021). Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra Untuk Mencari. 8(2), 140–148.
Ishlakhuddin, F., & SN, A. (2021). Ontology-based Chatbot to Support Monitoring of Server Performance and Security By Rule-base. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 15(2), 131. https://doi.org/10.22146/ijccs.58588
Ismanto hadi, E., & Iryanto, I. (2018). Penerapan Algoritma Dijkstra untuk Penentuan Jalur Terbaik Evakuasi Tsunami – Studi Kasus: Kelurahan Sanur Bali. JTT (Jurnal Teknologi Terapan), 4(2), 72–78. https://doi.org/10.31884/jtt.v4i2.79
Kusuma, E., & Agung, H. (2019). Aplikasi Perhitungan Dan Visualisasi Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek. Aplikasi Perhitungan Dan Visualisasi Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek, 08(1), 14–23.
Lestari, S. L., Ardiansyah, A., Giovani, A. P., & Dwijayanti, D. (2020). a Dijkstra Algorithm Implementation in Determining Shortest Route To Mosque in Residential Citra Indah City. Jurnal Pilar Nusa Mandiri, 16(1), 65–70. https://doi.org/10.33480/pilar.v16i1.1199
Rifanti, U. M. (2017). Pemilihan Rute Terbaik Menggunakan Algoritma Dijkstra Untuk Mengurangi ( Best Route Selection Use Dijkstra Algorithm To Reduce. 2(2), 90–99.
Tyagi, K. A. (2017). Bellman Ford Shortest Path Algorithm using Global Positioning System IRJET-Power Management in Wireless Sensor Network. 4.
Yulia, W. E., Istiadi, D., & Roqib, A. (2015). Pencarian spbu terdekat dan penentuan jarak terpendek menggunakan algoritma dijkstra. 1, 89–93.
