Citation

Zhang Z, Qin H, Wang K, He H, Liu T. Transp. Res. E Logist. Transp. Rev. 2017; 106: 45-59.

Copyright

(Copyright © 2017, Elsevier Publishing)

DOI

10.1016/j.tre.2017.08.002

PMID

unavailable

Abstract

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.

Language: en

Keywords

Healthcare; Manpower allocation; Variable neighborhood search; Vehicle routing