Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service

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.

[1]  Michel Gendreau,et al.  An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem , 2016 .

[2]  Simona Mancini,et al.  A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic , 2016 .

[3]  L. Song,et al.  Manpower allocation with time windows , 2004, J. Oper. Res. Soc..

[4]  Erik Demeulemeester,et al.  Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..

[5]  Peng Yang,et al.  Variable neighborhood search heuristic for storage location assignment and storage/retrieval scheduling under shared storage in multi-shuttle automated storage/retrieval systems , 2015 .

[6]  Byung-In Kim,et al.  The combined manpower-vehicle routing problem for multi-staged services , 2010, Expert Syst. Appl..

[7]  Peter Brucker,et al.  Personnel scheduling: Models and complexity , 2011, Eur. J. Oper. Res..

[8]  Andrew Lim,et al.  Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals , 2017, Transp. Sci..

[9]  David S.W. Lai,et al.  A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph , 2016 .

[10]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[11]  Abdullah Konak,et al.  The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion , 2016 .

[12]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[13]  Erik Demeulemeester,et al.  Workforce Planning Incorporating Skills: State of the Art , 2014, Eur. J. Oper. Res..

[14]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[15]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[16]  Mikael Rönnqvist,et al.  Laps Care - an operational system for staff planning of home care , 2006, Eur. J. Oper. Res..

[17]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[18]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[19]  Baruch Schieber,et al.  Vehicle Routing and Staffing for Sedan Service , 2006, Transp. Sci..

[20]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[21]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[22]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[23]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[24]  Andrew Lim,et al.  Manpower allocation with time windows and job teaming constraints , 2003 .

[25]  David S.W. Lai,et al.  A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph , 2016 .

[26]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[27]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[28]  Paolo Toth,et al.  A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem , 2014 .

[29]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[30]  Nubia Velasco,et al.  Combined routing and staff scheduling model for home health care , 2009 .

[31]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[32]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .