“日产日清”背景下的医疗废物清运车辆路径优化研究  

Vehicle Routing Optimization of Medical Waste Collection under“Daily Generation and Daily Clearing”

作　　者：李凡立 黄帅 王佩 林尤武 LI Fanli;HUANG Shuai;WANG Pei;LIN Youwu(School of Management,Guangdong University of Technology,Guangzhou 510520;School of Business,Guangdong University of Foreign Studies,Guangzhou 510006;School of Mathematics and Computing Science,Guilin University of Electronic Technology,Guilin Guangxi 541004,China)

机构地区：[1]广东工业大学管理学院,广州510520 [2]广东外语外贸大学商学院,广州510006 [3]桂林电子科技大学数学与计算科学学院,广西桂林541004

出　　处：《重庆师范大学学报（自然科学版）》2024年第2期88-99,共12页Journal of Chongqing Normal University:Natural Science

基　　金：广州市科技计划项目(No.202102020600);国家自然科学基金面上项目(No.71901074,No.11801105)。

摘　　要：研究“日产日清”背景下的清运车辆调度优化,以避免医疗废物引发二次污染。综合考虑医疗废物清运工作中面临的各种约束条件,建立混合整数优化模型。针对模型特点,设计混合蚁群算法,通过不断迭代求解整数优化子模型与线性规划子模型来得到合理的清运策略。构建的模型和算法可以有效帮助医疗废物处置企业决策合理的清运车辆访问顺序、访问时间、清运量以及车辆数与工作时间等。与传统模型相比,“日产日清”背景下的清运策略需要更多车辆与更高成本,但可以有效避免医疗废物的堆积。Vehicle routing optimization under“Daily Generation and Daily Clearing”is studied to avoid secondary pollution caused by medical waste.Considering the various constraints faced in the medical waste collection,a mixed integer optimization model is established.A hybrid ant colony algorithm is proposed according to the characteristics of the model.The reasonable strategy is obtained by continuously iteratively solving the integer optimization sub-model and the linear programming sub-model.The constructed model and algorithm can effectively help medical waste disposal companies to make reasonable decisions about the order,time,volume,number of vehicles and working hours for cleaning vehicles.Compared with the traditional model,the medical waste collection under the background of“Daily Generation and Daily Clearing”may require more vehicles and costs,but it can effectively avoid the accumulation of medical waste.

关 键 词：医疗废物清运 日产日清 需求可拆分 车辆路径规划 混合蚁群算法 

分 类 号：O224[理学—运筹学与控制论] X937[理学—数学]