Data-Driven Optimization of Garbage Collection Point Locations for Efficient Urban Solid Waste Management

Authors

  • U Balakrishna Department of Mathematics, SITAMS, Chittoor - 517127 Andhra Pradesh, India
  • Suresha R Department of Data Analytics and Mathematical Sciences, Faculty of Engineering and Technology, JAIN (Deemed-to-be University), Ramanagara-562112, Karnataka, India
  • Jayanth Kumar T Department of Data Analytics and Mathematical Sciences, Faculty of Engineering and Technology, JAIN (Deemed-to-be University), Ramanagara-562112, Karnataka, India
  • A Prakash Department of Mathematics, Vemu Institute of Technology, P kothakota, Chittoor -517112, Andhra Pradesh, India
  • Thupili Rama Mohan Reddy Department of Basic Sciences, Narayana Engineering College, Nellore-524003, Andhra Pradesh, India
  • Thangaraj M Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Chennai 600127, Tamil Nadu, India

DOI:

https://doi.org/10.70917/ijcisim-2026-3116

Keywords:

Garbage Collection Points, Solid Waste Management, Minimum Vertex Cover, Urban Road Networks, Genetic Algorithm, Hybrid Genetic Algorithm, Decision Support Systems, Sustainable Urban Planning

Abstract

Rapid urbanization and growing population density have made municipal solid waste management increasingly challenging, particularly in designing efficient and cost-effective garbage collection systems. Among the key planning decisions, the placement of Garbage Collection Points (GCPs) plays a vital role, as it influences the walking distance for residents, vehicle travel distance, fuel consumption, operational expenses, and the overall cleanliness of urban areas. However, while considerable attention has been given to optimizing waste collection routes, relatively little research has focused on determining the optimal locations of GCPs in real urban environments. To address this issue, this study formulates the GCP placement problem as a Minimum Vertex Cover (MVC) problem on an urban road network. This formulation identifies the minimum number of collection points required to provide complete coverage of all demand locations while maintaining service accessibility. To solve the problem effectively, a Hybrid Genetic Algorithm (HGA) is proposed, combining the global search capability of genetic algorithms with problem-specific local improvement techniques to enhance solution quality and convergence. The effectiveness of the proposed approach is evaluated through computational experiments on benchmark datasets and further demonstrated using a real-world case study from the Yadgir district. The results indicate that the proposed method consistently achieves complete coverage using fewer collection points, reduces vehicle travel requirements, and produces higher-quality solutions than conventional greedy and heuristic methods. These findings demonstrate that the proposed framework can serve as a practical decision-support tool for municipal authorities by enabling scalable, data-driven, and economically efficient planning of urban waste collection infrastructure. Since the approach relies on readily available geographic information, it can be adapted for waste management planning in medium-sized cities across different regions.

Downloads

Download data is not yet available.

Downloads

Published

2026-07-14

How to Cite

U Balakrishna, Suresha R, Jayanth Kumar T, A Prakash, Thupili Rama Mohan Reddy, & Thangaraj M. (2026). Data-Driven Optimization of Garbage Collection Point Locations for Efficient Urban Solid Waste Management. International Journal of Computer Information Systems and Industrial Management Applications, 18(7s), 559–574. https://doi.org/10.70917/ijcisim-2026-3116

Issue

Section

Original Articles