Large-Scale Vehicle Routing Problem for Municipal Waste Collection

The waste collection system with a transfer station and reduction complex replaces the mixed collection system, which improves the system efficiency but makes the vehicle routing problem more difficult. For this collection system, a mixed-integer programming model for the waste collection vehicle routing problem is developed with the objective of minimizing the total distance cost, and an adaptive large neighborhood search algorithm is designed. The problem is divided into two parts: the first part considers the vehicle routing problem from the customers to the processing and transfer facility, and the second part calculates the vehicle routing problem to the processing plant based on the results of the first part. The algorithm is designed according to the actual city facility scale, and the test results verify the effectiveness of the algorithm in meeting both the practical constraints and completing the solution in hourly time under the large-scale problem.