水准点(测量)
计算机科学
车辆路径问题
聚类分析
数学优化
功能(生物学)
相(物质)
2019年冠状病毒病(COVID-19)
钥匙(锁)
运筹学
布线(电子设计自动化)
数学
人工智能
医学
进化生物学
计算机网络
生物
地理
有机化学
计算机安全
化学
疾病
大地测量学
病理
传染病(医学专业)
作者
Daniele Ferone,Paola Festa,Serena Fugaro,Tommaso Pastore
摘要
Abstract The past few years of the COVID‐19 pandemic outbreak have shown that optimal management of medical specimens is a key aspect of healthcare logistics, both for addressing the delivery of perishable items such as vaccines, and for ensuring the timely analysis of swabs and samples. Accordingly, recent optimization literature described the problem of optimal collection and delivery of medical specimens, modeled as a multitrip vehicle routing problem with time windows and a completion time objective function. Aiming to achieve good‐quality solutions in short computational times, this work describes a hybrid approach, combining a matheuristic construction phase with an adaptive large neighborhood search (ALNS). Our matheuristic relies on a clustering algorithm to yield subsets of the medical specimens that are optimally served by single vehicles of the fleet. The solutions of the matheuristic phase serve as starting points for the ALNS intensification phase. Extensive experimentation on both new and established benchmark problem instances shows that our hybrid method is able to match the optimality of the state of the art on small instances and outperforms the existing exact method by one order of magnitude on larger problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI