CAJ | 학술논문

为满足城市医疗废弃物对回收处理时效性的高要求，提高城市医疗废弃物回收效率，构建了以总回收时间最短为优化目标的带有时间窗的车辆路径优化模型（VRPTW）。利用最大最小蚁群算法求解该模型，有效克服了一般蚁群算法容易早熟收敛的缺点，得到最短回收时间以及最优回收车辆数和最优行驶路径。最后，以成都市金牛区医疗废弃物回收为例，验证了模型的有效性。
위만족성시의료폐기물대회수처리시효성적고요구，제고성시의료폐기물회수효솔，구건료이총회수시간최단위우화목표적대유시간창적차량로경우화모형（VRPTW）。이용최대최소의군산법구해해모형，유효극복료일반의군산법용역조숙수렴적결점，득도최단회수시간이급최우회수차량수화최우행사로경。최후，이성도시금우구의료폐기물회수위례，험증료모형적유효성。
In this paper, in order to satisfy the timeliness requirement of the recycling and processing of urban medical wastes and improve the efficiency of the recycling process, we established a VRPTW model with the shortest total recycling time as the objective, solved it using the maximum-minimum ant colony algorithm, and at the end, demonstrated the effectiveness of the model through a case study on the medical waste recycling practice of the Jinniu District of Chengdu.