Implementasi Algoritma Dijkstra dan Greedy dalam Penyelesaian Masalah Rute Terpendek
DOI:
https://doi.org/10.53863/kst.v7i01.1654Keywords:
Dijkstra Algorithm, Greedy Algorithm, Shortest Route, Literature Study, Path OptimizationAbstract
The shortest route problem is a classic topic in graph theory that has many applications in everyday life, such as in navigation systems, logistics distribution, and network management. Two algorithms that are often used are the Algorithm and the Greedy Algorithm. The Algorithm can find the shortest path with maximum results, but it has a fairly high time complexity, making it less effective for situations that require speed. On the other hand, the Greedy Algorithm can provide solutions quickly, but does not always produce the ideal shortest path. This study uses a systematic literature review (SLR) approach to scientific publications in 2020-2025, which aims to analyze and compare the performance of the two algorithms in depth. The results of the analysis show that the Algorithm is more appropriate for situations that prioritize optimal solutions, while the Greedy Algorithm is better at decisions that require speed. This study not only provides theoretical analysis, but also discusses its practical applications in the transportation, logistics, and network sectors, and aims to provide insight into the development of more efficient and effective systems in the future
References
Amin, A., & Hendrik, B. (2023). Analisis penerapan algoritma Dijkstra dalam optimasi penentuan rute: Sebuah kajian literatur sistematis. Journal of Education Research, 6(1). https://doi.org/10.37985/jer.v6i1.2155
Aviram, N., & Shavitt, Y. (2015). Optimizing Dijkstra for real-world performance. arXiv preprint, arXiv:1505.05033. https://arxiv.org/abs/1505.05033
Agustina, C., & Rahmawati, E. (2021). Implementasi Algoritma Greedy dan Djikstra untuk Efektifitas Rute Pariwisata Populer di Borobudur. Jurnal Teknologi Informasi dan Terapan (J-TIT (Vol. 8, Issue 2). https://doi. org/10/25047/jtit. v8i2. 216.
Cantona, A., Fauziah, F., & Winarsih, W. (2020). Implementasi algoritma Dijkstra pada pencarian rute terpendek ke museum di Jakarta. Jurnal Teknologi dan Manajemen Informatika, 6(1), 27–34. https://doi.org/10.26905/jtmi.v6i1.3837
Iskandar, J. S., & Riti, Y. F. (2022). Perbandingan algoritma Greedy dan algoritma Dijkstra dalam pencarian rute terpendek dari Kabupaten Tuban ke Kota Surabaya. Petik: Jurnal Pendidikan Teknologi Informasi dan Komunikasi, 8(2), 96–106. https://doi.org/10.31980/petik.v8i2.1255
Lakutu, N. F., Mahmud, S. L., Katili, M. R., & Yahya, N. I. (2023). Algoritma Dijkstra dan algoritma Greedy untuk optimasi rute pengiriman barang pada Kantor Pos Gorontalo. Euler: Jurnal Ilmiah Matematika, Sains dan Teknologi, 11(1). https://doi.org/10.34312/euler.v11i1.18244
Madkour, A., Aref, W. G., Rehman, F. U., Rahman, M. A., & Basalamah, S. (2017). A survey of shortest-path algorithms. arXiv preprint, arXiv:1705.02044. https://arxiv.org/abs/1705.02044
Mahfoud, M. A. N., Hidayat, T., Sukrim, S., Sukisno, S., & Nugroho, A. H. (2023). Penerapan algoritma Dijkstra dan Greedy untuk optimasi rute angkut sampah di Kecamatan Periuk. Jurnal Ilmiah Matrik, 26(2). https://doi.org/10.33557/jurnalmatrik.v26i2.3259
Nainggolan, L. (2010). Algoritma A dan algoritma Greedy dalam pencarian lintasan terpendek* (Skripsi, Universitas Pendidikan Indonesia). https://repository.upi.edu/105267/
Pahlevi, M. R., & Komalasari, R. T. (2022). Implementasi algoritma Dijkstra rute terpendek pada aplikasi WisKul PasMing. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 6(4), 535–542. https://doi.org/10.35870/jtik.v6i4.554
Perayoga, R., Hendradi, P., & Setiawan, A. (2021). Implementasi algoritma Dijkstra pada pencarian rute terpendek objek wisata. KLIK: Kajian Ilmiah Informatika dan Komputer, 4(3). https://doi.org/10.30865/klik.v4i3.1495
Ramadhan, G. N., Bachrun, R. K. A., & Syaifulloh, A. (2024). Penerapan algoritma Dijkstra untuk menentukan rute terpendek tempat tinggal ke Kampus 2 UIN Sunan Ampel Surabaya. Indonesian Journal of Business Intelligence (IJUBI), 7(1), 1-6.
Syaifullah, M. B. (2025). Implementasi algoritma Dijkstra untuk menentukan rute terpendek dalam pendistribusian produk (Tesis Magister, Institut Teknologi Sepuluh Nopember). https://repository.its.ac.id/118237/
Sianipar, F. D., Arifin, M. H., Aulia, W., & Harliana, P. (2024). Estimasi Rute Terdekat Dari Universitas Negeri Medan Ke Spbu Terdekat Menggunakan Algoritma Greedy. JATI (Jurnal Mahasiswa Teknik Informatika), 8(6), 12218-12225.
Wiladi, M., Wasono, W., & Asmaidi, A. (2023). Penerapan algoritma Dijkstra dan algoritma Greedy pada optimasi jalur evakuasi banjir. Basis: Jurnal Ilmiah Matematika, 2(1), 25–38. https://doi.org/10.30872/basis.v2i1.1116
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Angelina Angul, Diana Fallo, Karolina Viviliana Tanggo, Ivonia Nazario Alves Belo, Fenesia Hoar

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International License that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal