Implementasi Algoritma Dijkstraa Berbasis Teori Graf untuk Penentuan Rute Terpendek dari STIKOM Tunas Bangsa ke Suzuya Merdeka Mall Kota Pematangsiantar
DOI:
https://doi.org/10.55606/jutiti.v6i1.7008Keywords:
Dijkstra Algorithm, Graph Theory, Navigation System, Shortest Path, Weighted GraphAbstract
Determining the shortest route is an important problem in graph theory that is widely applied in digital navigation systems. This study aims to implement the Dijkstra algorithm based on graph theory to determine the shortest route from STIKOM Tunas Bangsa to Suzuya Merdeka Mall in Pematangsiantar City. The research method used is a quantitative approach by modeling the road network as a weighted graph, where vertices represent locations or road intersections and edges represent road segments with distance weights. Distance data between locations were obtained through observation and digital map data from Google Maps, which were then processed using the Dijkstra algorithm to calculate the minimum distance from the starting point to the destination. The results show that the Dijkstra algorithm is able to determine the shortest route systematically and efficiently. The optimal route obtained is A → B → C → D → L with a total distance of 690 meters. The comparison results with Google Maps indicate a distance similarity of 0.69 km with an accuracy level of 99%. Therefore, the Dijkstra algorithm is proven to be effective in solving the shortest path problem and has the potential to be implemented in web-based or mobile navigation systems.
Downloads
References
Agusnur, A. (2025). Peran teori graf dalam perancangan jaringan transportasi cerdas. Jurnal Matematika dan Aplikasi, 1(1), 33-39.
Bappeda Kota Pematangsiantar. (2023). Laporan tahunan transportasi Kota Pematangsiantar 2023.
Berutu, I., Auzi, S., Ashillah, S., & Harliana, P. (2025). Integrasi algoritma Dijkstra pada aplikasi QGIS untuk simulasi rute tercepat di Medan: Studi kasus rute dari Universitas Negeri Medan ke Rumah Sakit Royal Prima. JATI (Jurnal Mahasiswa Teknik Informatika, 9(1), 453-461. https://doi.org/10.36040/jati.v9i1.12296
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). MIT Press.
Danuri, M. (2019). Perkembangan dan transformasi teknologi digital. Jurnal Ilmiah Infokam, 15(2). https://doi.org/10.53845/infokam.v15i2.178
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. https://doi.org/10.1007/BF01386390
Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. https://doi.org/10.1109/TSSC.1968.300136
Jaro, K. S. A., Khopipah, K., & Napis, N. (2025). Matematika diskrit teori graf pada LRT dalam mengatasi kemacetan: Studi literatur. Pentagon: Jurnal Matematika dan Ilmu Pengetahuan Alam, 3(3), 60-71. https://doi.org/10.62383/pentagon.v3i3.726
Manalu, E., Napitupulu, V., Afriyani, M., & Butar-Butar, H. B. (2025). Penerapan algoritma Dijkstra jalur terpendek antar objek wisata Danau Toba. Jurnal Manajemen Informatika Jayakarta, 5(4), 375-386. https://doi.org/10.52362/jmijayakarta.v5i4.2002
Pratama, A., & Wijaya, S. (2019). Implementasi algoritma Dijkstra untuk pencarian rute terpendek pada sistem informasi geografis. Jurnal Ilmu Komputer dan Informatika, 5(3), 112-125.
Rahman, F. (2021). Analisis perbandingan algoritma pencarian jalur terpendek dalam aplikasi navigasi. Jurnal Sistem Informasi, 7(1), 23-35.
Safetra, M. F. C., Desviona, N., Helmina, H., Rianti, A., & Prayogi, M. R. (2026). Penerapan teori graf dalam kehidupan sehari-hari. Algoritma: Jurnal Matematika, Ilmu Pengetahuan Alam, Kebumian dan Angkasa, 4(1), 52-68. https://doi.org/10.62383/algoritma.v4i1.923
Umam, J., Umam, K., Wibowo, N. C. H., & Ulinuha, M. A. (2025). Analisis perbandingan algoritma Dijkstra, Haversine, dan Distance Matrix API pada penentuan jarak sekolah di Kota Semarang. Jurnal Teknologi dan Manajemen Informatika, 11(1), 58-68. https://doi.org/10.26905/jtmi.v11i1.15544
Wahyudi, R., Siregar, T. R., & Lubis, A. R. (2020). Implementasi algoritma Dijkstra untuk optimasi rute kendaraan umum di Kota Medan. Jurnal Teknologi dan Sistem Informasi, 8(2), 123-131.
Zhan, F., & Noon, C. E. (1998). Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1), 65-73. https://doi.org/10.1287/trsc.32.1.65
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Jurnal Teknik Informatika dan Teknologi Informasi
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
