A Survey on Workforce Scheduling and Routing Problems

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at dierent locations hence requir- ing some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers' locations, security guards performing rounds at dierent premises, etc. We re- fer to these scenarios as Workforce Scheduling and Routing Problems (WSRP) as they usually involve the scheduling of personnel combined with some form of routing in order to ensure that employees arrive on time to the locations where tasks need to be performed. This kind of problems have been tackled in the literature for a number of years. This paper presents a survey which attempts to identify the common attributes of WSRP scenarios and the so- lution methods applied when tackling these problems. Our longer term aim is to achieve an in-depth understanding of how to model and solve workforce scheduling and routing problems and this survey represents the rst step in this quest.

[1]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

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

[3]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[4]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[5]  Mikael Rönnqvist,et al.  Operations Research Improves Quality and Efficiency in Home Care , 2009, Interfaces.

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

[7]  S. Jara-Díaz.  Allocation and Valuation of Travel-Time Savings , 2007 .

[8]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[9]  K. Takahashi,et al.  A Support System for Home Care Service Based on Multi-agent System , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[10]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[11]  Hesham K. Alfares,et al.  Survey, Categorization, and Comparison of Recent Tour Scheduling Literature , 2004, Ann. Oper. Res..

[12]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

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

[14]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[15]  Graham Kendall,et al.  Hybrid Heuristic for Multi-carrier Transportation Plans , 2011 .

[16]  David M. Miller,et al.  An Integrated Spatial DSS for Scheduling and Routing Home-Health-Care Nurses , 1997 .

[17]  Manuela Pérez-Pérez,et al.  Telework, Human Resource Flexibility and Firm Performance , 2007 .

[18]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[19]  Holmes E. Miller.  Personnel scheduling in public systems: a survey , 1976 .

[20]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[21]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[22]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[23]  J. Cohen,et al.  Home care. , 1987, Nursing.

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

[25]  Jennifer Lynn Rich,et al.  A Home Health Care Routing and Scheduling Problem , 1998 .

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

[27]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[28]  M. Rönnqvist,et al.  A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints , 2007 .

[29]  Dominique Feillet,et al.  A tutorial on column generation and branch-and-price for vehicle routing problems , 2010, 4OR.

[30]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .

[31]  Pieter Smet,et al.  Security personnel routing and rostering: a hyper-heuristic approach , 2011 .

[32]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[33]  Alan Mercer,et al.  The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..

[34]  A. Matta,et al.  A Home Care Scheduling Model For Human Resources , 2006, 2006 International Conference on Service Systems and Service Management.

[35]  Susan C. Eaton,et al.  If You Can Use Them: Flexibility Policies, Organizational Commitment, and Perceived Performance , 2003 .

[36]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem , 2008 .

[37]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies , 2012, Eur. J. Oper. Res..

[38]  Patrick De Causmaecker,et al.  Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem , 2010, IEEE Congress on Evolutionary Computation.

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

[40]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[41]  Jong-Bae Park,et al.  An Improved Particle Swarm Optimization for , 2010 .

[42]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

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

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

[45]  Matteo Fischetti,et al.  A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem , 2004, Networks.

[46]  Jean-Charles Billaut,et al.  An extended multiple Traveling Salesman Problem , 2009 .

[47]  Mogens Fosgerau,et al.  The value of travel time variance , 2010 .

[48]  Pisal Yenradee,et al.  An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling , 2008 .

[49]  Ezgi Yıldız.  Multi-depot vehicle scheduling with disruptions , 2011 .

[50]  V. De Angelis,et al.  Planning Home Assistance for AIDS Patients in the City of Rome, Italy , 1998, Interfaces.

[51]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[52]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[53]  M. Silaghi,et al.  A new optimization algorithm , 2000 .

[54]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[55]  Esben Kolind,et al.  The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach , 2009, Comput. Oper. Res..

[56]  R. Golembiewski,et al.  A survey of the empirical literature on flexible workhours: character and consequences of a major innovation. , 1978, Academy of management review. Academy of Management.

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