Penerapan Algoritma Dijkstra Dan Greedy Untuk Optimasi Rute Angkut Sampah Di Kecamatan Periuk

  • Muhammad Adam Nadjib Mahfoud Universitas Islam Syekh Yusuf
  • Taufik Hidayat Universitas Islam Syekh Yusuf
  • Sukrim Sukrim Universitas Islam Syekh Yusuf
  • Sukisno Sukisno Universitas Islam Syekh Yusuf
  • Asep Hardiyanto Nugroho Universitas Islam Syekh Yusuf
Keywords: Dijkstra's Algorithm, Greedy Algorithm, Route Optimization, Garbage Transport

Abstract

Abstract :  The increase in population in urban areas has resulted in an increase in the volume of waste generated. This creates problems in waste management, especially in determining efficient transportation routes. This study aims to optimize waste transportation routes in Periuk Subdistrict, Tangerang City, by applying Dijkstra and Greedy algorithms. Dijkstra's algorithm is used to find the shortest path based on the minimum distance traveled, while the Greedy algorithm is used to select the path that looks most profitable at each step. Geographical data in the form of coordinates of Waste Disposal Sites (TPS) and the distance between TPS are used as input in both algorithms. The results showed that Dijkstra's algorithm produced the shortest route with a distance of 16.7 km, more efficient than the route produced by the Greedy algorithm with a distance of 24.1 km

References

I. nurani Dewi, I. Royani, S. Sumarjan, and H. Jannah, “Pemberdayaan Masyarakat Melalui Pengelolaan Sampah Skala Rumah Tangga Menggunakan Metode Komposting,” Sasambo: Jurnal Abdimas (Journal of Community Service), vol. 2, no. 1, pp. 12–18, Mar. 2020, doi: https://doi.org/10.36312/sasambo.v2i1.172

S. Manyullei, L. M. Saleh, N. I. Arsyi, A. P. Azzima, and N. Fadhilah, “Penyuluhan Pengelolaan Sampah dan PHBS di Sekolah Dasar 82 Barangmamase Kecamatan Galesong Selatan Kab. Takalar,” Jurnal Altifani Penelitian dan Pengabdian kepada Masyarakat, vol. 2, no. 2, pp. 169–175, Mar. 2022, doi: https://doi.org/10.25008/altifani.v2i2.210

W. Czekała, J. Drozdowski, and P. Łabiak, “Modern Technologies for Waste Management: A Review,” Aug. 01, 2023, Multidisciplinary Digital Publishing Institute (MDPI). doi: https://doi.org/10.3390/app13158847

B. Turan, V. Hemmelmayr, A. Larsen, and J. Puchinger, “Transition towards sustainable mobility: the role of transport optimization,” Cent Eur J Oper Res, vol. 32, no. 2, pp. 435–456, Jun. 2024, doi: https://doi.org/10.1007/s10100-023-00888-8

R. R. Al Hakim et al., “Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah,” EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi, vol. 11, no. 1, p. 42, Jun. 2021, doi: http://dx.doi.org/10.36448/expert.v11i1.1939

A. Cantona, F. Fauziah, and W. Winarsih, “Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta,” Jurnal Teknologi dan Manajemen Informatika, vol. 6, no. 1, Apr. 2020, doi: https://doi.org/10.26905/jtmi.v6i1.3837

S. Yosua, C. Sigalingging, J. Jipesya, and Y. Jumaryadi, “Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat,” Jurnal Ilmiah FIFO, vol. 13, no. 1, p. 85, Dec. 2021, doi: https://dx.doi.org/10.22441/fifo.2021.v13i1.009

A. C. Wibowo and A. D. Wowor, “Perancangan Distribusi Hasil Produk Textil dengan Rute Terdekat dengan Algoritma Greedy,” J-SAKTI (Jurnal Sains Komputer & Informatika), vol. 7, no. 1, 2023. Doi : http://dx.doi.org/10.30645/j-sakti.v7i1.592

L. Suryani and E. Murniyasih, “Pencarian Rute Terpendek pada Aplikasi Ojek Sampah dengan Menggunakan Algoritma Djikstra,” Jurnal Teknik Informasi dan Komputer (Tekinkom), vol. 5, no. 2, p. 385, Dec. 2022, doi: https://doi.org/10.37600/tekinkom.v5i2.586

M. R. Wayahdi, S. H. N. Ginting, and D. Syahputra, “Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path,” International Journal of Advances in Data and Information Systems, vol. 2, no. 1, pp. 45–52, Feb. 2021, doi: https://doi.org/10.25008/ijadis.v2i1.1206

R. Rizky, T. Hidayat, A. H. Nugroho, and Z. Hakim, “Implementasi Metode A*Star Pada Pencarian Rute Terdekat Menuju Tempat Kuliner di Menes Pandeglang Banten,” Geodika: Jurnal Kajian Ilmu dan Pendidikan Geografi, vol. 4, no. 1, pp. 85–94, Jun. 2020, doi: https://doi.org/10.29408/geodika.v4i1.2068

H. Pratiwi, “Application Of The Dijkstra Algorithm To Determine The Shortest Route From City Center Surabaya To Historical Places,” Jurnal Teknologi Dan Sistem Informasi Bisnis, vol. 4, no. 1, pp. 213–223, Jan. 2022, doi: 10.47233/jteksis.v4i1.407.

J. Setiawan, R. S. Prakoso, and K. Suryaningrum., “Penentuan Rute Terpendek menuju pusat Perbelanjaan di Jakarta menggunakan Algoritma Dijkstra,” jurnalmatrik, vol. 21, no. 3, pp. 156–165, Dec. 2019., doi : https://doi.org/10.33557/jurnalmatrik.v21i3.715

H. Aburas, I. Shahrour, and C. Giglio, “Route Planning under Mobility Restrictions in the Palestinian Territories,” Sustainability, vol. 16, no. 2, p. 660, Jan. 2024, doi: https://doi.org/10.3390/su16020660

Y. Nora, M., D. Jollyta., and F. Saputra, “Analisis Sistem Jalur Terpendek Menggunakan Algoritma Djikstra dan Evaluasi Usability,” JEPIN (Jurnal Edukasi dan Penelitian Informatika), vol. 6, no. 1, 2020. doi: https://dx.doi.org/10.26418/jp.v6i1.37627

A. Januantoro, A. Faqih Septiyanto, A. Kartika, and W. Hapantenda, “Penentuan Rute Optimal pada Distribusi Barang Menggunakan Algoritma Greedy (Studi Kasus: UD XYZ),” KONVERGENSI, Vol 17 No 1 (2021). doi: https://doi.org/10.30996/konv.v17i1.5295

Published
2024-10-07
How to Cite
Mahfoud, M. A., Hidayat, T., Sukrim, S., Sukisno, S., & Nugroho, A. (2024). Penerapan Algoritma Dijkstra Dan Greedy Untuk Optimasi Rute Angkut Sampah Di Kecamatan Periuk. Jurnal Ilmiah Matrik, 26(2), 151–161. https://doi.org/10.33557/jurnalmatrik.v26i2.3259
Section
Articles
Abstract viewed = 50 times
PDF : 69 times