APPLICATION OF DIJKSTRA'S ALGORITHM IN DETERMINING THE SHORTEST ROUTE TO MRICAN LANDFILL
Abstract views: 11
,
PDF downloads: 19
Keywords:
Algoritma Dijkstra, Pengelolaan Sampah, Rute Terpendek, Simulasi Rute, Waktu Tempuh
Abstract
This research explores the implementation of Dijkstra's Algorithm to determine the shortest route in waste management, particularly from Temporary Disposal Sites (TPS) to the Mrican Final Processing Site (TPA). With advancements in information technology, determining an efficient waste collection route is crucial for reducing operational costs, travel time, and fuel consumption. This study utilizes historical data and current road conditions to simulate routes, addressing challenges such as traffic congestion and unpredictable road conditions. Dijkstra's Algorithm has been proven effective in previous studies in transportation and logistics contexts, and is thus adopted in this study. The results show that applying this algorithm can enhance waste transportation efficiency, providing practical solutions for TPA Mrican management to optimize collection routes, reduce operational costs, and improve collection time efficiency.
Downloads
Download data is not yet available.
References
DAFTAR PUSTAKA
[1] Z. Pratama, D. Hartama, M. Ridwan Lubis, S. Retno Andani, and I. Okta Kirana, “Penerapan Metode Dijkstra untuk Menentukan Jalur Lintasan Terpendek Kota Kisaran Menuju Objek Wisata Simalungun,” Rekayasa Tek. Inform. dan Inf., vol. 1, no. 2, pp. 68–77, 2020, [Online]. Available: https://djournals.com/resolusi
[2] L. Suryani and E. Murniyasih, “Pencarian Rute Terpendek Pada Aplikasi Ojek Sampah Dengan Menggunakan Algoritma Djikstra,” J. Tek. Inf. dan Komput., vol. 5, no. 2, p. 385, 2022, doi: 10.37600/tekinkom.v5i2.586.
[3] A. Cantona, F. Fauziah, and W. Winarsih, “Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta,” J. Teknol. dan Manaj. Inform., vol. 6, no. 1, pp. 27–34, 2020, doi: 10.26905/jtmi.v6i1.3837.
[4] D. Ariyanto, “Penerapan Algoritma Dijkstra Pada Manajemen Order Pemasangan Jaringan Internet Wilayah Telkom Madiun,” Universitas Muhammadiyah Ponorogo, 2023.
[5] N. H. Adi, M. Giatman, W. Simatupang, A. Afrina, and R. Watrianthos, “Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek,” Build. Informatics, Technol. Sci., vol. 3, no. 3, pp. 235–243, 2021, doi: 10.47065/bits.v3i3.1052.
[6] Talenta Arta Deva Victoria and Hermansyah, “Penerapan Algoritma Dijkstra dalam Pemetaan UMKM Berbasis Android,” Bull. Comput. Sci. Res., vol. 3, no. 6, pp. 420–426, 2023, doi: 10.47065/bulletincsr.v3i6.276.
[7] H. R Saputrama, “Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek dari Kampus A UIN Raden Fatah ke Tempat Bersejarah di Palembang,” E-Jurnal Mat., vol. 10, no. 3, pp. 173–178, 2021, doi: 10.33369/diophantine.v2i1.28321.
[8] N. Arif Sudibyo, P. Eka Setyawan, and Y. Putra Surya Rahmad Hidayat, “Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten Klaten,” Riemann Res. Math. Math. Educ., vol. 2, no. 1, pp. 1–9, 2020.
[9] L. I. Hapsari, “Penerapan Algoritma Djikstra Dalam Pencarian Rute Terpendek Truk Pengangkut Sampah (Studi Kasus : Kabupaten Jember),” Universitas Jember, 2019. [Online]. Available: http://repository.unej.ac.id/
[10] M. C. Bunaen, H. Pratiwi, and Y. F. Riti, “Penerapan Algoritma Dijkstra Untuk Menentukan RuteTerpendek Dari Pusat Kota Surabaya Ke Tempat Bersejarah,” J. Teknol. Dan Sist. Inf. Bisnis, vol. 4, no. 1, pp. 213–223, 2022, [Online]. Available: https://media.neliti.com/media/publications/441390-application-of-the-Dijkstra-algorithm-to-f1576853.pdf
[11] I. Syarifudin and K. Ramanda, “Penerapan Metode Dijkstra Pada Sistem Informasi Pencarian Jarak Terpendek Menuju Rumah Sakit di Wilayah Jakarta Barat,” J. Sains Komput. Inform. (J-SAKTI, vol. 5, no. 2, pp. 540–550, 2021.
[12] G. N. Ramadhan and R. K. A. A. S. Bachrun, “Penerapan algoritma Dijkstra Untuk menentukan Rute Terpendek Tempat Tinggal Ke Kampus 2 Uin Sunan Ampel Surabaya,” Indones. J. Bus. Intell., vol. 7, no. 1, pp. 1–6, 2024.
[13] T. Ardiansah and D. Hidayatullah, “Penerapan Metode Waterfall Pada Aplikasi Reservasi Lapangan Futsal Berbasis Web,” J. Inf. Technol. Softw. Eng. Comput. Sci., vol. 1, no. 1, pp. 6–13, 2023, doi: 10.58602/itsecs.v1i1.8.
[14] R. R. Az-zahra, T. A. Ramadhani, and R. A. Nuryadin, “Perancangan Sistem Informasi Geografis Pemetaan Layanan Kesehatan Kabupaten Ponorogo Berbasis Website ‘E-HEALTHY,’” J. Ris. dan Apl. Mhs. Inform., vol. 04, no. 04, pp. 767–774, 2023, doi: https://doi.org/10.30998/jrami.v4i04.8670.
[1] Z. Pratama, D. Hartama, M. Ridwan Lubis, S. Retno Andani, and I. Okta Kirana, “Penerapan Metode Dijkstra untuk Menentukan Jalur Lintasan Terpendek Kota Kisaran Menuju Objek Wisata Simalungun,” Rekayasa Tek. Inform. dan Inf., vol. 1, no. 2, pp. 68–77, 2020, [Online]. Available: https://djournals.com/resolusi
[2] L. Suryani and E. Murniyasih, “Pencarian Rute Terpendek Pada Aplikasi Ojek Sampah Dengan Menggunakan Algoritma Djikstra,” J. Tek. Inf. dan Komput., vol. 5, no. 2, p. 385, 2022, doi: 10.37600/tekinkom.v5i2.586.
[3] A. Cantona, F. Fauziah, and W. Winarsih, “Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta,” J. Teknol. dan Manaj. Inform., vol. 6, no. 1, pp. 27–34, 2020, doi: 10.26905/jtmi.v6i1.3837.
[4] D. Ariyanto, “Penerapan Algoritma Dijkstra Pada Manajemen Order Pemasangan Jaringan Internet Wilayah Telkom Madiun,” Universitas Muhammadiyah Ponorogo, 2023.
[5] N. H. Adi, M. Giatman, W. Simatupang, A. Afrina, and R. Watrianthos, “Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek,” Build. Informatics, Technol. Sci., vol. 3, no. 3, pp. 235–243, 2021, doi: 10.47065/bits.v3i3.1052.
[6] Talenta Arta Deva Victoria and Hermansyah, “Penerapan Algoritma Dijkstra dalam Pemetaan UMKM Berbasis Android,” Bull. Comput. Sci. Res., vol. 3, no. 6, pp. 420–426, 2023, doi: 10.47065/bulletincsr.v3i6.276.
[7] H. R Saputrama, “Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek dari Kampus A UIN Raden Fatah ke Tempat Bersejarah di Palembang,” E-Jurnal Mat., vol. 10, no. 3, pp. 173–178, 2021, doi: 10.33369/diophantine.v2i1.28321.
[8] N. Arif Sudibyo, P. Eka Setyawan, and Y. Putra Surya Rahmad Hidayat, “Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten Klaten,” Riemann Res. Math. Math. Educ., vol. 2, no. 1, pp. 1–9, 2020.
[9] L. I. Hapsari, “Penerapan Algoritma Djikstra Dalam Pencarian Rute Terpendek Truk Pengangkut Sampah (Studi Kasus : Kabupaten Jember),” Universitas Jember, 2019. [Online]. Available: http://repository.unej.ac.id/
[10] M. C. Bunaen, H. Pratiwi, and Y. F. Riti, “Penerapan Algoritma Dijkstra Untuk Menentukan RuteTerpendek Dari Pusat Kota Surabaya Ke Tempat Bersejarah,” J. Teknol. Dan Sist. Inf. Bisnis, vol. 4, no. 1, pp. 213–223, 2022, [Online]. Available: https://media.neliti.com/media/publications/441390-application-of-the-Dijkstra-algorithm-to-f1576853.pdf
[11] I. Syarifudin and K. Ramanda, “Penerapan Metode Dijkstra Pada Sistem Informasi Pencarian Jarak Terpendek Menuju Rumah Sakit di Wilayah Jakarta Barat,” J. Sains Komput. Inform. (J-SAKTI, vol. 5, no. 2, pp. 540–550, 2021.
[12] G. N. Ramadhan and R. K. A. A. S. Bachrun, “Penerapan algoritma Dijkstra Untuk menentukan Rute Terpendek Tempat Tinggal Ke Kampus 2 Uin Sunan Ampel Surabaya,” Indones. J. Bus. Intell., vol. 7, no. 1, pp. 1–6, 2024.
[13] T. Ardiansah and D. Hidayatullah, “Penerapan Metode Waterfall Pada Aplikasi Reservasi Lapangan Futsal Berbasis Web,” J. Inf. Technol. Softw. Eng. Comput. Sci., vol. 1, no. 1, pp. 6–13, 2023, doi: 10.58602/itsecs.v1i1.8.
[14] R. R. Az-zahra, T. A. Ramadhani, and R. A. Nuryadin, “Perancangan Sistem Informasi Geografis Pemetaan Layanan Kesehatan Kabupaten Ponorogo Berbasis Website ‘E-HEALTHY,’” J. Ris. dan Apl. Mhs. Inform., vol. 04, no. 04, pp. 767–774, 2023, doi: https://doi.org/10.30998/jrami.v4i04.8670.
Published
2024-11-15
How to Cite
[1]
F. Kuncoro, I. Abdurrozzaq Zulkarnain, and G. Asrofi Buntoro, “APPLICATION OF DIJKSTRA’S ALGORITHM IN DETERMINING THE SHORTEST ROUTE TO MRICAN LANDFILL”, antivirus, vol. 18, no. 2, pp. 200-211, Nov. 2024.
Section
Articles
Copyright (c) 2024 Antivirus : Jurnal Ilmiah Teknik Informatika
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Copyright on any article is retained by the author(s).
- Author grant the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
- The article and any associated published material is distributed under the Creative Commons Attribution-ShareAlike 4.0 International License
