Saving matrix method and nearest neighbor method for garbage transport route problems

Transporting waste vehicle routes can be viewed as a Vehicle Routing Problem (VRP). Nowadays, the problem of garbage transport vehicles in Ilir Barat I District is an important responsibility of the city government. In solving the problem of garbage collection vehicle routes, we propose a waste collection vehicle routing problem with time windows that pay attention to service time and rest time so that the distance traveled and travel time are optimal. This model is solved using the saving matrix and nearest neighbor method. The route of transporting waste from the Temporary Landfill (TL) to the Landfill (LF) is carried out randomly, causing insufficient travel time and distance. The working time of the waste transportation process in Ilir Barat I District is carried out in two sessions, namely session 1: at 07.00-11.00 West Indonesian Time (WIT) and session 2: 16.00-20.00 WIT. Garbage collectors have a break of 5 hours. The calculation of the waste transportation routes using the saving matrix method is obtained by grouping several TL into one route and sorting using the nearest neighbor method. The results show that the garbage collection vehicle at work session 1 serves Region 1, Region 2, Region 3, Region 4, and Region 5 with a total distance of 126.31 km with a total travel time of 5.67 hours. As for the working time of session 2, the garbage collection vehicle serves Region 6, Region 7, Region 8, and Region 9 with a total distance of 151.91 km and a total travel time of 6.3 hours. We found that the total travel time of the waste transporting vehicle exceeded the working time, thus cutting the rest time of the garbage transporter.