Optimasi Rute Pengangkutan Sampah dengan Menggunakan Metode Nearest Neighbour (Studi Kasus: Kabupaten Manokwari, Papua Barat)

Abstract

: Proportionally, with the population growth, the waste generation that must be transported will also increase in Manokwari Regency. Not optimal existing waste transportation cause not all wastes transported on time and wastes becomes heap at several temporary waste storage (TPS) sites. The Manokwari Regency, selected as only three of the four districts, has waste transportation services. This study aims to optimize the existing waste transportation route by applying the Vehicle Routing Problem (VRP) method to generate the fastest route. From the sampling results, it was found that the average waste generation from the 3 (three) districts was 0.334 kg/person/day. With the existing route, it takes 3,289 minutes per day to transport the waste from 25 temporary waste storage (TPS) units to the final disposal site (TPA) of Masiepi located in South Manokwari District. Transportation route optimization resulted in a total transportation time of 3.038 minutes/day, which is 251 minutes/day faster than the existing conditions. The number of garbage trucks required is also less, i.e., 13 units compared to the existing condition of 15 units. From this study, it was found that the transportation of waste can help to shorten the time of transportation and reduce the need for trucks, thus reducing the cost requirements for overall waste management in Manokwari Regency.