Solving the Waste Collection Routing Problem Using Geographic Information System-Genetic Algorithm

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Waste Collection Routing Problem (WCRP) presents a significant challenge for municipalities and waste management companies. This study applies Geographic Information System and Genetic Algorithm (GIS-GA) to optimise waste collection routes in WPKL16, Kuala Lumpur. A comparative analysis of crossover operators between Order Crossover (OX) and Partially Mapped Crossover (PMX) reveals that PMX consistently outperforms OX in both solution quality and computational efficiency. GIS-GA is implemented in Python to generate optimised routes, demonstrating substantial improvements over existing waste collection paths. Additionally, reducing waste collection to four days per week significantly decreases the total distance travelled while maintaining operational efficiency. These findings emphasise the importance of crossover operator selection in GA-based optimisation and highlight the potential of strategic scheduling adjustments to enhance cost-effectiveness and sustainability in waste management.

Cite

CITATION STYLE

APA

Ahmad, A., Rahman, A., Chin, A., & Fen, L. S. (2025). Solving the Waste Collection Routing Problem Using Geographic Information System-Genetic Algorithm. In Journal of Physics: Conference Series (Vol. 3114). Institute of Physics. https://doi.org/10.1088/1742-6596/3114/1/012016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free