Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option

Abstract

This research introduces the Multi-Depot Waste Collection Vehicle Routing Problem with Time Windows and Self-Delivery Option (MDWCVRPTW-SDO). The problem comes from the waste bank operation implemented in Yogyakarta City, Indonesia. A set of vehicles is dispatched from the waste banks to pick up waste from residents’ locations within the time windows specified by the residents. Residents may be compensated for delivering their waste to a waste bank by themselves. The objective of MDWCVRPTW-SDO is minimizing the sum of investment costs, routing costs, and total compensation paid to the residents. We model this problem as a mixed integer linear programming model and propose Simulated Annealing (SA) as an effective solution approach. Extensive computational experiments confirm that SA is effective to solve MDWCVRPTW-SDO. Moreover, the number of waste banks, compensation paid to residents, and the distribution of residents of each type are crucial for the success of the implementation.