Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows.

BACKGROUND

Improper disposal of urban medical waste is likely to cause a series of neglective impacts. Therefore, we have to consider how to improve the efficiency of urban medical waste recycling and lowering carbon emissions when facing disposal.

METHODS

This paper considers the multi-cycle medical waste recycling vehicle routing problem with time windows for preventing and reducing the risk of medical waste transportation. First, a mixed-integer linear programming model is formulated to minimize the total cost consisting of the vehicle dispatch cost and the transportation costs. In addition, an improved neighborhood search algorithm is designed for handling large-sized problems. In the algorithm, the initial solution is constructed using the Clarke-Wright algorithm in the first stage, and the variable neighborhood search algorithm with a simulated annealing strategy is introduced for exploring a better solution in the second stage.

RESULTS

The computational results demonstrate the performance of the suggested algorithm. In addition, the total cost of recycling in the periodic strategy is lower than with the single-cycle strategy.

CONCLUSIONS

The proposed model and algorithm have the management improvement value of the studied medical waste recycling vehicle routing problem.