K-Means Clustering Method for Determining Waste Transportation Routes to Landfill

Abstract

Waste is worsening in Magelang City, especially in urban areas. As a result of poorly managed waste disposal, a landfill is needed. Magelang City has a landfill called TPA Banyuurip, located in Plumbon Hamlet, Banyuurip Village, Tegalrejo Subdistrict, Magelang City. From this case, the application of the kmeans clustering method to determine the efficiency of the waste transportation route to the landfill is needed. The research began by conducting direct observations at the Banyuurip landfill by interviewing the drivers of waste vehicles to find out information such as waste sources, transportation schedules, etc. In this study, the data used are the name and address of the supplier, sub-district, coordinate point, and distance from the supplier's place to the landfill. After data collection, data preprocessing is done by dividing and selecting data based on sub-districts. Then the data is processed using the kmeans clustering algorithm to divide the route efficiency and the haversine formula algorithm to determine the closest distance between clusters. After the data has been successfully processed, the number of clusters is 4 for north Magelang, where each cluster will become a corridor with four routes. For central Magelang, 2 clusters with two routes, while for south Magelang, the results are 4 clusters with four routes. From these results, the evaluation results using silhouette score for data clustering of 3 sub-districts are 0.632560 for North Magelang, 0.640667 for Central Magelang, and 0.630186 for South Magelang. This method is expected to help in grouping routes and mapping supplier areas effectively and efficiently in the waste transportation process in Magelang City.