Abstract
A sudden surge in urbanization and population has escalated challenges in cities in waste generation, making efficient route optimization for waste management a critical necessity. This study proposes a hybrid metaheuristic framework, Locally Optimized Discrete Cuckoo Search (LO-DCS), for an effective route optimization in urban waste management. The proposed algorithm adapts the classical Cuckoo Search algorithm to discrete routing problems by integrating permutation-based random walk, 2-opt local optimization and K-means clustering. The input data is obtained from waste bin coordinates which were extracted using Google Earth Engine and georeferenced satellite imagery within a predefined region of interest. The proposed framework was implemented on real-world urban datasets from Bengaluru city using multiple performance indicators, including travel distance, fuel consumption, carbon emission and operational time. Extensive experiments involving 30 independent runs were performed to assess stability and robustness. Comparative analysis with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Discrete Spider Monkey Optimization (DSMO) and Quantum-based Avian Navigation algorithm (QANA) demonstrates the competitive performance of LO-DCS across all the bin clusters. Statistical significance test was used to validate the results using Wilcoxon and Friedman tests with Holm correction. Furthermore, optimality gap analysis using exact solvers confirms that LO-DCS produces near-optimal solutions for moderate-sized bin-cluster instances. The experimental results show that LO-DCS achieves an average improvement of approximately 85% across the clusters for all the key performance indicators (distance, fuel consumption, CO2 emission and travel time). When compared with the baseline methods, it achieves an improvement of 78% approximately with a strong convergence behaviour. The implemented approach provides a scalable, data-driven decision-support tool for sustainable and cost-effective urban waste management. The municipal authorities and researchers can gain valuable insights from the findings toward environmentally responsible infrastructure planning.
Similar content being viewed by others
Data availability
The datasets generated and/or analysed during the current study are available in the repositoryhttps://drive.google.com/file/d/1DmmrIFV9TblPWTTR4nDHY2gBhMK0MLc9/view? usp=drive\_link.
References
Sharma, K. D. & Jain, S. Municipal solid waste generation, composition, and management: the global scenario. Social Responsib. J. 16 (6), 917–948 (2020).
Kaza, S., Yao, L., Bhada-Tata, P. & Van Woerden, F. What a Waste 2.0: a Global Snapshot of Solid Waste Management To 2050 (World Bank, 2018).
Idrissi, A., Benabbou, R., Benhra, J., Haji, E. & M Solid waste management through the application of AI and ICT: a systematic literature review. J. Environ. Eng. Sci. 20 (2), 88–121 (2025).
Gandomi, A. H., Yang, X. S. & Alavi, A. H. Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng. Comput. 29 (1), 17–35 (2013).
Yang, X. S. & Deb, S. Cuckoo search via Lévy flights. In 2009 World congress on nature & biologically inspired computing (NaBIC) 210–214. Ieee. (2009), December.
Guerrero, L. A., Maas, G. & Hogland, W. Solid waste management challenges for cities in developing countries. Waste Manage. 33 (1), 220–232 (2013).
Longhi, S. et al. Solid waste management architecture using wireless sensor network technology. In 2012 5th international conference on new technologies, mobility and security (NTMS)1–5. IEEE. (2012), May.
Folianto, F., Low, Y. S. & Yeow, W. L. Smartbin: Smart waste management system. In 2015 IEEE tenth international conference on intelligent sensors, Sensor Networks and Information Processing (ISSNIP) 1–2. IEEE. (2015), April.
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D. & Juan, A. A. Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR). 47 (2), 1–28 (2014).
Vidal, T., Battarra, M., Lahyani, R. & Martinelli, R. Optimizing a waste collection system with solid waste transfer stations. Comput. Ind. Eng. 168, 107618 (2022).
Dantzig, G. B. & Ramser, J. H. The truck dispatching problem. Manage. Sci. 6 (1), 80–91 (1959).
Flood, M. M. The traveling-salesman problem. Oper. Res. 4 (1), 61–75 (1956).
Clarke, G. & Wright, J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 (4), 568–581 (1964).
Toth, P. & Vigo, D. Branch-and-bound algorithms for the capacitated VRP. In The Vehicle Routing Problem.Society for Industrial and Applied Mathematics. 29–51 (2002).
Fisher, M. L. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42 (4), 626–642 (1994).
Hadjiconstantinou, E., Christofides, N. & Mingozzi, A. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. 61 (1), 21–43 (1995).
Desrochers, M., Desrosiers, J. & Solomon, M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 (2), 342–354 (1992).
Bertsimas, D. J. A vehicle routing problem with stochastic demand. Oper. Res. 40 (3), 574–585 (1992).
Gaudioso, M. & Paletta, G. A heuristic for the periodic vehicle routing problem. Transport. Sci. 26 (2), 86–92 (1992).
Sandhya, V. K. Issues in solving vehicle routing problem with time window and its variants using meta heuristics-a survey. Int. J. Eng. Technol. 3 (6), 668–672 (2013).
Gillet, B. E., Miller, L. E. & Johnson, J. G. Vehicle dispatching—Sweep algorithm and extensions. Disaggregation: Probl. Manuf. Service Organizations, 471–483. (1979).
Grefenstette, J. J. Genetic algorithms and machine learning. In Proceedings of the sixth annual conference on Computational learning theory 3–4. (1993), August.
Dorigo, M. & Di Caro, G. Ant colony optimization: a new meta-heuristic. In Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406) 2,1470–1477. IEEE. (1999), July.
Karaboga, D. & Basturk, B. Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In International Fuzzy Systems Association World Congress 789–798 (Springer, 2007).
Akhand, M. A. H., Ayon, S. I., Shahriyar, S. A., Siddique, N. & Adeli, H. Discrete spider monkey optimization for travelling salesman problem. Appl. Soft Comput. 86, 105887 (2020).
Jain, A. K., Mao, J. & Mohiuddin, K. M. Artificial neural networks: A tutorial. Computer 29 (3), 31–44 (1996).
Kim, H., Yang, J. & Lee, K. D. Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea. Transp. Res. Part. D: Transp. Environ. 14 (5), 291–299 (2009).
Ramos, T. R. P., Gomes, M. I. & Barbosa-Póvoa, A. P. Economic and environmental concerns in planning recyclable waste collection systems. Transp. Res. E. 62, 34–54 (2014).
Qiao, Q., Tao, F., Wu, H., Yu, X. & Zhang, M. Optimization of a capacitated vehicle routing problem for sustainable municipal solid waste collection management using the PSO-TS algorithm. Int. J. Environ. Res. Public Health. 17 (6), 2163 (2020).
Bing, X., de Keizer, M., Bloemhof-Ruwaard, J. M. & van der Vorst, J. G. Vehicle routing for the eco-efficient collection of household plastic waste. Waste Manage. 34 (4), 719–729 (2014).
Erdem, M. Optimisation of sustainable urban recycling waste collection and routing with heterogeneous electric vehicles. Sustainable Cities Soc. 80, 103785 (2022).
Gajpal, Y., Abdulkader, M. M. S., Zhang, S. & Appadoo, S. S. Optimizing garbage collection vehicle routing problem with alternative fuel-powered vehicles. Optimization 66 (11), 1851–1862 (2017).
Hess, C., Dragomir, A. G., Doerner, K. F. & Vigo, D. Waste collection routing: a survey on problems and methods. Cent. Eur. J. Oper. Res. 32 (2), 399–434 (2024).
Battarra, M., Erdoğan, G. & Vigo, D. Exact algorithms for the clustered vehicle routing problem. Oper. Res. 62 (1), 58–71 (2014).
Erçin, M., Köse, M., Atasoy, A., Altıntaş, U. & Kös, R. Route optimization for waste collection process through IoT supported waste management system. In IEEE conference on institute for computational and mathematical engineering12, (1–8). (2021), January.
Ropke, S. & Pisinger, D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport. Sci. 40 (4), 455–472 (2006).
Helsgaun, K. An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126 (1), 106–130 (2000).
Zamani, H., Nadimi-Shahraki, M. H. & Gandomi, A. H. QANA: Quantum-based avian navigation optimizer algorithm. Eng. Appl. Artif. Intell. 104, 104314 (2021).
Kool, W., Van Hoof, H. & Welling, M. Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475. (2018).
Kocsis, K., Kövendi, J. & Bokor, B. Waste collection route optimisation for the second waste-to-energy plant in Budapest. Sustainable Cities Soc. 117, 105953 (2024).
Marseglia, G., Mesa, J. A., Ortega, F. A. & R. Piedra-de-la-Cuadra A heuristic for the deployment of collecting routes for urban recycle stations (eco-points). Socio-Economic Plann. Sci. 82, 101222 (2022).
Lakhouit, A. Revolutionizing urban solid waste management with AI and iot: a review of smart solutions for waste collection, sorting, and recycling. Results Engineering, 104018. (2025).
Kandpal, N. et al. Utilizing artificial intelligence and machine learning for enhanced recycling efforts. In AI Technologies for Enhancing Recycling Processes (65–82). IGI Global Scientific Publishing. (2025).
Ogbolumani, O. A. & Adekoya, M. Intelligent waste management optimization through machine learning analytics. J. Sci. Res. Reviews. 2 (1), 7–26 (2025).
Alsabt, R., Alkhaldi, W., Adenle, Y. A. & Alshuwaikhat, H. M. Optimizing waste management strategies through artificial intelligence and machine learning-An economic and environmental impact study. Clean. Waste Syst. 8, 100158 (2024).
Zhang, Z. & Yang, J. A discrete cuckoo search algorithm for traveling salesman problem and its application in cutting path optimization. Comput. Ind. Eng. 169, 108157 (2022).
Acknowledgements
The authors extend their appreciation to the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) for funding this work through (grant number IMSIU-DDRSP2602).
Funding
This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-DDRSP2602).
Author information
Authors and Affiliations
Contributions
Conceptualization, A.G. and P.N.V.; methodology, A.G., P.N.V., P.P.; software, P.P.; validation, P.P., A.K.J.S. and A.G.; formal analysis, A.G., P.N.V.; investigation, A.G., P.N.V., A.K.J.S. and P.P; resources, P.P., A.K.J.S.; data curation, A.G.; writing—original draft preparation, A.G., P.N.V.; writing—review and editing, A.G., P.N.V., P.P, and A.K.J.S.; visualization, P.P. and A.K.J.S.; supervision, P.P; project administration, P.P. and A.K.J.S.; funding acquisition, A.K.J.S.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Below is the link to the electronic supplementary material.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
About this article
Cite this article
Goswami, A., N. V., P., P., P. et al. Route optimization in urban waste management using locally adjusted discrete cuckoo search: a hybrid metaheuristic approach. Sci Rep (2026). https://doi.org/10.1038/s41598-026-40208-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-026-40208-z
