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

具有时间窗的多循环医疗废物回收车辆路径问题的可变邻域搜索算法

阅读:1

Abstract

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.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。