Shortest Route Optimization for Waste Collection Using ACO-Based CVRP : Case Study of Banjar Basa and Banjar Tembau, Marga
DOI:
https://doi.org/10.24843/JMAT.2026.v16.i01.p194Keywords:
Ant Colony Optimization (ACO), Capacitated Vehicle Routing Problem (CVRP), Waste Collection, Route Optimization, Marga VillageAbstract
The increasing volume of household waste in rural areas has created challenges in transportation management, particularly in determining efficient waste collection routes. This study aims to optimize waste transportation routes in Marga Village, Tabanan Regency, focusing on Banjar Basa and Banjar Tembau, which have distinct topographical and settlement characteristics. The optimization process was formulated as a Capacitated Vehicle Routing Problem (CVRP) and solved using the Ant Colony Optimization (ACO) algorithm. The research began by modeling the waste collection points as graph vertices, with roads serving as edges weighted by distance. Simulation results showed that Banjar Basa, which has a larger area and more collection points, required two trips to cover all nodes, whereas Banjar Tembau required only one trip due to its smaller and denser topology. The ACO algorithm successfully identified the shortest and most efficient route configuration, with pheromone updates guiding the convergence toward the global optimum. The combination of parameters yielded stable convergence and effective route minimization. These results demonstrate that ACO is a robust and adaptive approach for optimizing waste transportation systems in rural regions, offering a sustainable solution for reducing operational costs and improving environmental quality.
References
[1] Badan Pusat Statistik, Statistik Lingkungan Hidup Indonesia 2021: Energi dan Lingkungan, Katalog 3305001. Jakarta: Badan Pusat Statistik, 2021.
[2] Badan Pusat Statistik Kabupaten Tabanan, Kecamatan Marga dalam Angka 2017, Katalog BPS 11020015102050. Tabanan: Badan Pusat Statistik Kabupaten Tabanan, 2017.
[3] Badan Pusat Statistik Kabupaten Tabanan, Kabupaten Tabanan dalam Angka 2024, Katalog 51021102001. Tabanan: Badan Pusat Statistik Kabupaten Tabanan, 2024.
[4] S. K. Okrah, E. N. Wiah, H. Otoo, and J. A. Addor, “A velocity-based ACO algorithm for optimizing routes and social cost,” Scientific African, vol. 23, p. e02031, 2024.
[5] M. Li, B. Li, Z. Qi, J. Li, and J. Wu, “Optimized APF-ACO algorithm for ship collision avoidance and path planning,” Journal of Marine Science and Engineering, vol. 11, no. 6,2023.
[6] M. L. Mutar, M. A. Burhanuddin, A. S. Hameed, N. Yusof, and H. J. Mutashar, “An efficient improvement of ant colony system algorithm for handling capacity vehicle routing problem,” Int. J. Ind. Eng. Comput., vol. 11, pp. 549–564, 2020.
[7] Z. H. Ahmed, A. S. Hameed, M. L. Mutar, and H. Haron, “An enhanced Ant Colony System algorithm based on subpaths for solving the Capacitated Vehicle Routing Problem,” Symmetry, vol. 15, no. 11, Nov. 2023.
[8] M. Teguh, W. Fuadi, and Z. Fitri, “Application of Ant Colony Algorithm to Determine the Shortest Route for Nature and Culinary Tourism in North Aceh,” International Journal of Engineering, Science and Information Technology, vol. 5, no. 2, pp. 413–423, Apr. 2025
[9] F. Suryana, Nurdin, and D. Hamdhana, “Implementation of Ant Colony Optimization (ACO) Algorithm for Route Optimization of Tourist Paths in Takengon,” Journal of Applied Informatics and Computing (JAIC), vol. 9, no. 4, pp. 1886–1896, Aug. 2025.
[10] K. Tomitagawa, A. Anuntachai, S. Chotipant, O. Wongwirat, and S. Kuchii, “Performance Measurement of Energy Optimal Path Finding for Waste Collection Robot Using ACO Algorithm,” IEEE Access, vol. 10, pp. 117261–117272, Nov. 2022
[11] S. K. Okrah, E. N. Wiah, H. Otoo, and J. Kangah, “Application of a modified ACO algorithm for optimizing routes and externality effect of solid waste management,” American Academic Scientific Research Journal for Engineering, Technology, and Sciences (ASRJETS), vol. 93, no. 1, pp. 140–155, Jun. 2023.
[12] I. B. K. P. Arimbawa K, “Ant Colony Optimization for Waste Collection Routing: A Case Study in Sekar Tunjung Residential,” Brilliance: Research of Artificial Intelligence, vol. 5, no. 1, pp. 175–186, May 2025.
[13] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, Feb. 1996.
[14] M. Dorigo and G. Di Caro, “The ant colony optimization meta-heuristic,” New Ideas in Optimization, pp. 11–32, 1999.
[15] M. Dorigo, T. Stützle, G. Di Caro, and L. M. Gambardella, “The ant colony optimization metaheuristic: Algorithms, applications, and advances,” Handbook of Metaheuristics, pp. 250–285, 2003.
[16] I. B. K. P. Arimbawa K, I. G. A. Novitasari, and P. N. A. Permana, “Application of Ant Colony Optimization on CVRP for Waste Collection Route Optimization in Marga Village,” Brilliance: Research of Artificial Intelligence, vol. 5, no. 2, pp. 940–951, 2025.
[17] I. B. K. P. Arimbawa K, “Algoritma Djikstra: Rute pengungsian terpendek daerah rawan bencana di Desa Canggu,” Jurnal Matematika, vol. 14, no. 1, pp. 52–60, 2024.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Ida Bagus Kade Puja Arimbawa K, I Gusti Ayu Novitasari, Putu Nanda Andika Permana

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.












