Study on minimizing routing distance and maximizing efficiency of waste disposal process based on Dynamic Vehicle Routing Model

Abstract

This article explores the optimization of route planning problems in various waste disposal scenarios. Starting with the Vehicle Routing Problem without Capacity Constraints, the objective is to minimize the total mileage traveled by four refuse vehicles while servicing ten waste disposal points. Moving on to ensure efficient waste disposal with capacity constraints, the model is further adapted. Time constraints are then introduced for each disposal point, and finally, the dynamic nature of waste disposal sites is addressed in a real-time scheduling model for dynamic environments.

For Problem 1, the article establishes a vehicle routing model and solves it to obtain the optimal routes: The route for vehicle 1 is [0, 6, 1, 9, 7, 4, 8, 5, 0], for vehicle 2 is [6, 0, 4, 9, 2, 3, 0], for vehicle 3 is [0, 4, 7, 6, 1, 8, 2, 5, 0], and for vehicle 4 is [6, 9, 4, 0, 2, 3, 0]. The total distance covered by all four vehicles is 36.10 units.

For Problem 2, the article incorporates vehicle capacity constraints into the model developed in Problem 1 and solves it to obtain the optimal routes.

For Problem 3, a vehicle routing model is established, and time window constraints are introduced based on the model developed in Problem 2. The solution reveals the optimal routes and timings for waste disposal.

For Problem 4, the article extends the model from Problem 3 to accommodate dynamic environments. The solution reflects the real-time adjustments in vehicle routes based on new tasks or changes in waste disposal sites. The article discusses the completion of tasks by each vehicle and the spare capacity available after specific disposal points.