Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service
Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service
复制标题
非紧急救护车转运服务中的人力分配和车辆路径问题
DOI：
10.1016/j.tre.2017.08.002
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Liu Tian
中科院分区：
文献类型：
--
作者：
Zhang Zizhen;Qin Hu;Wang Kai;He Huang;Liu Tian
我们提出了一个人力分配和车辆路径问题（MAVRP），这是一个现实生活中的医疗保健问题，来自香港公立医院的非紧急救护车转运服务。人力和车辆是医院日常运作的关键资源。服务提供者需要制定有效的时间表，派遣司机、助手和救护车运送分散在不同地点的病人。本文将MAVRP问题转化为一个数学规划模型，提出了几种可变邻域搜索（VNS）算法，并在MAVRP问题实例上测试了最速下降、第一下降和两种下降策略混合的VNS算法。计算结果验证了VNS算法的有效性和效率。此外，我们还进行了额外的实验，以分析车辆的数量对MAVRP实例的解决方案的影响。
We present a manpower allocation and vehicle routing problem (MAVRP), which is a real-life healthcare problem derived from the non-emergency ambulance transfer service in Hong Kong public hospitals. Both manpower and vehicles are critical resources for the hospitals in their daily operations. The service provider needs to make an effective schedule to dispatch drivers, assistants and ambulances to transport patients scattered in different locations. We formulate the MAVRP into a mathematical programming model and propose several variable neighborhood search (VNS) algorithms to solve it. We tested the VNS with steepest descent, first descent and a mixed of two descent strategies on the MAVRP instances. The computational results demonstrate the effectiveness and efficiency of the VNS algorithms. Moreover, we also conducted additional experiments to analyze the impact of the number of vehicles on the solutions of the MAVRP instances.