Optimasi Vehicle Routing Problem (VRP) Terhadap Rute Pengangkutan Sampah di Kota Medan Dengan Algoritma Ant Colony Optimization
DOI:
10.29303/jm.v7i3.9787Published:
2025-08-07Downloads
Abstract
The growing population in Medan City has resulted in a significant increase in waste volume, creating the need for an efficient transportation system from Temporary Disposal Sites (TPS) to the Final Disposal Site (TPA). This study aims to apply the Ant Colony Optimization (ACO) algorithm to improve the efficiency of waste collection routes in the Medan Marelan District. ACO is a metaheuristic algorithm inspired by the foraging behavior of ants, where pheromone trails guide route selection. In this research, TPS and TPA locations were divided into six zones. Each zone was analyzed to determine the most efficient route based on the shortest travel distance. The research methodology consists of two main phases: route construction and pheromone updating. Data analysis was conducted manually for the first zone and through computational simulations using Python for the remaining five zones. The results show that ACO effectively produced optimal waste transportation routes in all areas. The shortest routes obtained were: Zone 1 at 17.05 km, Zone 2 at 25.25 km, Zone 3 at 16.995 km, Zone 4 at 8 km, Zone 5 at 14.83 km, and Zone 6 at 11.5 km. These findings confirm that the ACO algorithm is effective in addressing the Vehicle Routing Problem (VRP) in the context of waste transportation and offers a promising approach for enhancing urban waste management systems.
Keywords:
Ant Colony Optimization; Optimal Route; Medan MarelanReferences
Afgani, N. Y. (2023). Aplikasi Algoritma Ant Colony Optimization Pada Vehicle Rounting Problem Dalam Pengoptimalan Rute Pengangkutan Sampah Di Kecamatan Sukarami Dan Ilir Barat I Kota Palembang. AT-TAWASSUTH: Jurnal Ekonomi Islam, VIII(I), 1–19.
Arda, M., Andriany, D., & Manurung, Y. H. (2020). Analisis SWOT dalam Menentukan Strategi Pengelolaan Sampah Rumah Tangga Kota Medan. Prosiding Konferensi Nasional Ekonomi Manajemen Dan Akuntansi (KNEMA) Journal Homepage, 1177, 1–12.
Ary, M. (2022). Optimasi Vehicle Routing Problem Pada Rute Pendistribusian Menggunakan Metode Ant Colony Optimization. Jurnal Tekno Insentif, 16(2), 139–149. https://doi.org/10.36787/jti.v16i2.897
Daulay, M. S., & Cipta, H. (2023). Zero : Journal of Science , Mathematics , and Applied Optimization of Garbage Collection Routes Using The Clarke-Wright Saving Heuristic Method in Medan. 7(1), 23–32.
Fauziah, R., & Suparmi, S. (2022). Sistem Pengangkutan Sampah Di Kota Jambi. Jambura Health and Sport Journal, 4(2), 127–138. https://doi.org/10.37311/jhsj.v4i2.15458
Fitriastutik, E. (2020). Optimasi Pengangkutan Sampah Oleh DKRTH Surabaya: Penyusunan Vehicle Routing Problem Untuk Pengangkutan Sampah dan Kajian Pengganti Kendaraan. 6.
Hazizah, S., Lubis, R. S., & Cipta, H. (2023). Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer. Mathline : Jurnal Matematika Dan Pendidikan Matematika, 8(2), 345–358. https://doi.org/10.31943/mathline.v8i2.388
Lasut, A. C., Makalew, F. M., & Opit, P. F. (2019). Analisis Rute Pengangkutan Sampah Kota Manado Dengan Pendekatan Vehicle Routing Problem (Vrp). Jurnal Ilmiah Realtech, 15(1), 7–12. https://doi.org/10.52159/realtech.v15i1.75
Muliawan, A. (2022). Penerapan Algoritma Ant Colony Untuk Menentukan Jalur Terpendek Di Bank Sampah Malang.
Nasution, M. khairani. (2020). Sampah Ke Tempat Pembuangan Akhir ( Tpa ) Berbasis Geographic Information System ( Gis ) Di Kota Malang.
Neroni, M. (2021). Ant colony optimization with warm-up. Algorithms, 14(10). https://doi.org/10.3390/a14100295
Prayoga, G. B. (2020). Optimasi Vehicle Routing Problem (VRP) Sampah Kota Pekanbaru Zona 1 Menggunakan Penerapan Hibridisasi Metode Algoritma Nearest Neighbor dan Simulated Annealing.
Rachmawati, R., & Yosmar, S. (2025). Using Ant Colony Optimization to Solve a Vehicle Routing Problem : Waste Transportation Routes in Bengkulu City Case Study. Edumatsains, 9(2), 333–345.
Sasmito, A., Cathrynn, J., Tanaka, M., Sampe, M. Z., & Mulya, U. P. (2024). Modified Snow Avalanches Algorithm untuk Vehicle Routing Problem. Limits: Journal Of Mathematics and Its Aplpications, 21(3), 429–446.
Sianturi, R. Y. C., Rahayudi, B., & Widodo, A. W. (2021). Implementasi Algoritma Ant Colony Optimization untuk Optimasi Rute Distribusi Produk Kebutuhan Pokok dari Toko Sasana Bonafide Mojoroto . Jurnal Pengembangan Teknologi Informasi Dan Ilmu Komputer, 5(7), 3190–3197.
Tan, S., & Yeh, W. (2021). applied sciences The Vehicle Routing Problem : State-of-the-Art Classification and Review. Applied Sciences, 11.
Udjulawa, D., & Oktarina, S. (2022). Penerapan Algoritma Ant Colony Optimization Untuk Pencarian Rute Terpendek Lokasi Wisata. Klik - Jurnal Ilmu Komputer, 3(1), 26–33. https://doi.org/10.56869/klik.v3i1.326
Wang, M., Ma, T., Li, G., Zhai, X., & Qiao, S. (2020). Ant Colony Optimization with an Improved Pheromone Model for Solving MTSP with Capacity and Time Window Constraint. IEEE Access, 8, 106872–106879. https://doi.org/10.1109/ACCESS.2020.3000501
Zhao, J., Cheng, D., & Hao, C. (2016). An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle. Mathematical Problems in Engineering. https://doi.org/10.1155/2016/7672839
License
Copyright (c) 2025 Tri Kinanti, Rima Aprilia
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
