A parallel matheuristic for the technician routing and scheduling problem

The Technician Routing and Scheduling Problem (TRSP) consists in routing staff to serve requests for service, taking into account time windows, skills, tools, and spare parts. Typical applications include maintenance operations and staff routing in telecoms, public utilities, and in the health care industry. In this paper, we present a formal definition of the TRSP, discuss its relation with the Vehicle Routing Problem with Time Windows (VRPTW), and review related research. From a methodological perspective, we describe a matheuristic composed of a constructive heuristic, a parallel Adaptive Large Neighborhood Search, and a mathematical programming based post-optimization procedure that successfully tackles the TRSP. We validate the matheuristic on the Solomon VRPTW instances, where we achieve an average gap of $$0.23\,\%$$, and matched 44 out of 55 optimal solutions. Finally, we illustrate how the matheuristic successfully solves a set of TRSP instances extended from the Solomon benchmark.

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

[2]  Christian Prins,et al.  Two memetic algorithms for heterogeneous fleet vehicle routing problems , 2009, Eng. Appl. Artif. Intell..

[3]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[4]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[5]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[6]  Pisal Yenradee,et al.  PSO-based algorithm for home care worker scheduling in the UK , 2007, Comput. Ind. Eng..

[7]  Torsten Fahle,et al.  A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem , 2006, Comput. Oper. Res..

[8]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

[9]  Edward P. K. Tsang,et al.  Fast local search and guided local search and their application to British Telecom's workforce scheduling problem , 1997, Oper. Res. Lett..

[10]  Gilbert Laporte,et al.  Scheduling technicians and tasks in a telecommunications company , 2008, J. Sched..

[11]  Elise Miller-Hooks,et al.  Scheduling technicians for planned maintenance of geographically distributed equipment , 2007 .

[12]  Hideki Hashimoto,et al.  A GRASP-based approach for technicians and interventions scheduling for telecommunications , 2011, Ann. Oper. Res..

[13]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[14]  Steve Y. Chiu,et al.  Effective Heuristic Procedures for a Field Technician Scheduling Problem , 2001, J. Heuristics.

[15]  Juan G. Villegas.  Vehicle routing problems with trailers , 2012, 4OR.

[16]  Richard F. Hartl,et al.  Adaptive large neighborhood search for service technician routing and scheduling problems , 2012, J. Sched..

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

[18]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..