Modeling and Optimization of Multi-Model Waste Vehicle Routing Problem Based on the Time Window

Abstract

With the development of China's economy, the urban floating population is also increasing, resulting in a sharp increase in the amount of urban waste. How to recycle and dispose of municipal waste more efficiently has become the top concern of municipalities and other relevant departments. In this article, the above problem is transformed into the municipal waste collection vehicle routing problem (MWCVRP) to solve the problem with the minimum total waste transportation cost. Because the carrying capacity of different models is different, this article introduces a cost calculation criterion that combines the total mileage of different models of transport vehicles and the number of station services. A multi-model garbage truck path optimization model is established, and then a heuristic-based task dynamic assignment algorithm is designed to solve the problem. The Solomon dataset is used to verify the feasibility and effectiveness of the model and algorithm through experiments.