A deep reinforcement learning and fractional packing framework for routing and scheduling in healthcare waste supply chains

Norhan Khallaf , Osama Abdel‑Raouf , Mohiy Hadhoud , Mohamed Dawam , Ahmed Kafafy
{"title":"A deep reinforcement learning and fractional packing framework for routing and scheduling in healthcare waste supply chains","authors":"Norhan Khallaf ,&nbsp;Osama Abdel‑Raouf ,&nbsp;Mohiy Hadhoud ,&nbsp;Mohamed Dawam ,&nbsp;Ahmed Kafafy","doi":"10.1016/j.sca.2025.100164","DOIUrl":null,"url":null,"abstract":"<div><div>Artificial intelligence (AI) is increasingly utilized in healthcare logistics, including automated systems for collecting hazardous medical waste from hospitals under strict time and capacity constraints. This study compares three routing algorithms: (1) Google Maps Destination using an application programming interface (API), (2) hybrid clustering with Deep Q-Network (DQN), and (3) a hybrid method combining clustering, the fractional knapsack strategy, and DQN. These algorithms aim to optimize route planning and scheduling for medical waste collection vehicles operating under real-world constraints such as limited vehicle capacity and fixed service windows. The routing problem is modeled as both a capacitated vehicle routing problem (CVRP) and a CVRP with time windows (CVRPTW), capturing complexities. A multi-trip routing strategy is integrated into the promising algorithms to assess its impact on performance metrics, including capacity utilization, travel distance, total operational time, and number of trips. Experimental results indicate hybrid approach with clustering, fractional knapsack, and DQN outperforms others. It achieved capacity utilization rates of 96.47 percent for CVRP and 76.01 % for CVRPTW, requiring six vehicles, a 25 % reduction compared to the Google Maps API method, while matching the performance of clustering with DQN under time constraints. The CVRP model improved capacity utilization by 28.9 % over Google Maps API and 85.1 % over clustering with DQN. Although travel distance increased slightly (0.61 % in CVRP and 7.2 % in CVRPTW), total operational time was reduced by 7.6 and 4.6 %. The proposed model also minimized extra trips, requiring none for CVRP and only one for CVRPTW, compared to two additional trips needed by clustering with DQN in both scenarios. These findings highlight the hybrid approach as a robust, efficient solution for medical waste transportation under complex conditions.</div></div>","PeriodicalId":101186,"journal":{"name":"Supply Chain Analytics","volume":"12 ","pages":"Article 100164"},"PeriodicalIF":0.0000,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Supply Chain Analytics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949863525000640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Artificial intelligence (AI) is increasingly utilized in healthcare logistics, including automated systems for collecting hazardous medical waste from hospitals under strict time and capacity constraints. This study compares three routing algorithms: (1) Google Maps Destination using an application programming interface (API), (2) hybrid clustering with Deep Q-Network (DQN), and (3) a hybrid method combining clustering, the fractional knapsack strategy, and DQN. These algorithms aim to optimize route planning and scheduling for medical waste collection vehicles operating under real-world constraints such as limited vehicle capacity and fixed service windows. The routing problem is modeled as both a capacitated vehicle routing problem (CVRP) and a CVRP with time windows (CVRPTW), capturing complexities. A multi-trip routing strategy is integrated into the promising algorithms to assess its impact on performance metrics, including capacity utilization, travel distance, total operational time, and number of trips. Experimental results indicate hybrid approach with clustering, fractional knapsack, and DQN outperforms others. It achieved capacity utilization rates of 96.47 percent for CVRP and 76.01 % for CVRPTW, requiring six vehicles, a 25 % reduction compared to the Google Maps API method, while matching the performance of clustering with DQN under time constraints. The CVRP model improved capacity utilization by 28.9 % over Google Maps API and 85.1 % over clustering with DQN. Although travel distance increased slightly (0.61 % in CVRP and 7.2 % in CVRPTW), total operational time was reduced by 7.6 and 4.6 %. The proposed model also minimized extra trips, requiring none for CVRP and only one for CVRPTW, compared to two additional trips needed by clustering with DQN in both scenarios. These findings highlight the hybrid approach as a robust, efficient solution for medical waste transportation under complex conditions.
用于医疗废物供应链中路由和调度的深度强化学习和分级包装框架
人工智能(AI)越来越多地用于医疗保健物流,包括在严格的时间和能力限制下从医院收集危险医疗废物的自动化系统。本研究比较了三种路由算法:(1)谷歌使用应用程序编程接口(API)映射目的地,(2)与Deep Q-Network (DQN)混合聚类,(3)结合聚类,分数背包策略和DQN的混合方法。这些算法旨在优化在车辆容量有限和固定服务窗口等现实约束下运行的医疗废物收集车辆的路线规划和调度。将路径问题建模为有能力车辆路径问题(CVRP)和带时间窗口的车辆路径问题(CVRPTW),以捕获复杂性。将多行程路由策略集成到有前途的算法中,以评估其对性能指标的影响,包括容量利用率、行程距离、总操作时间和行程数。实验结果表明,基于聚类、分数背包和DQN的混合方法优于其他方法。CVRP的容量利用率为96.47%,CVRPTW的容量利用率为76.01 %,需要6辆车,与谷歌Maps API方法相比降低了25 %,同时在时间限制下与DQN的聚类性能相当。CVRP模型比谷歌Maps API提高了28.9 %的容量利用率,比DQN集群提高了85.1% %的容量利用率。虽然旅行距离略有增加(CVRP为0.61 %,CVRPTW为7.2 %),但总操作时间分别减少了7.6和4.6 %。所提出的模型还最小化了额外的行程,CVRP不需要额外的行程,CVRPTW只需要一次行程,相比之下,在两种情况下,使用DQN聚类都需要额外的两次行程。这些发现突出表明,混合方法是复杂条件下医疗废物运输的一种稳健、有效的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信