Oktaviana Hasna Nabila, Feddy Setio Pribadi
Waste management in rural Indonesia faces significant challenges as the volume of household waste increases. Waste banks are proposed as a solution to overcome this problem. This study aims to design an efficient waste management area in Gondangmanis Village by determining the optimal location of waste collection points and the shortest waste pickup route using clustering and Travelling Salesman Problem (TSP) approaches. The K-Means clustering algorithm is used to form clusters and determine the center point of each cluster, where the K value is first optimized using a genetic algorithm. Furthermore, the genetic algorithm is also applied to optimize the TSP to find the most efficient waste pickup route. The data used includes 1181 coordinate points in the study area, with household waste production of 2.5 kg/day/house and the capacity of the waste collection bin. The results showed that placing a waste collection bin with a capacity of 0.8 m³ with 4 clusters was more effective than 3 clusters with a capacity of 1 m³. TSP optimization resulted in the shortest waste pickup route with 19581 km, thus reducing travel distance and operational time. This approach is expected to increase waste management efficiency in rural areas, support environmental conservation, and optimize waste bank operations. © This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Department of Electrical Engineering, Universitas Negeri Semarang, Sekaran, Gunungpati, Semarang, 50229, Indonesia
