Weekly scheduling models for traveling therapists

Abstract This paper presents a series of models that can be used to find weekly schedules for therapists who provide ongoing treatment to patients throughout a geographical region. In all cases, patient-appointment times and visit days are known prior to the beginning of the planning horizon. Variations in the models include single vs. multiple home bases, homogeneous vs. heterogeneous therapists, lunch break requirements, and a nonlinear cost structure for mileage reimbursement and overtime. The single home base and homogeneous therapist cases proved to be easy to solve and so were not thoroughly investigated. This left two cases of interest: the first included only lunch breaks while the second added nonlinear overtime and mileage reimbursement costs. For the first case, 40 data sets were solved, each consisting of either 15 or 20 therapists and between roughly 300 and 540 patient visits over five days. For each instance, we were able to obtain the minimum cost of providing residential healthcare services using a commercial solver. The results showed that CPU time increases more rapidly than total cost as the total number of visits grows. For the second case, which was much more difficult, it was necessary to develop heuristics to find good solutions quickly. Results for 5- through 20-therapist instances are presented and compared to the linear programming relaxation lower bounds. In the first of two parametric analyses, the tradeoff between the number of therapists on staff and the cost of providing service was examined. In the second, a similar tradeoff was explored between cost can the number of home bases used by the therapists.

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

[2]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[3]  L. Bianco,et al.  A set partitioning approach to the multiple depot vehicle scheduling problem , 1994 .

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

[5]  Nora Super Who Will Be There to Care? The Growing Gap between Caregiver Supply and Demand , 2002 .

[6]  Jean-Charles Billaut,et al.  Home health care problem: An extended multiple Traveling Salesman Problem , 2009 .

[7]  Marco A. Boschetti,et al.  An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem , 2004, Ann. Oper. Res..

[8]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[9]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[10]  M. Fischetti,et al.  Heuristic algorithms for the multiple depot vehicle scheduling problem , 1993 .

[11]  Jonathan F. Bard,et al.  Large-scale constrained clustering for rationalizing pickup and delivery operations , 2009 .

[12]  Michael Schröder,et al.  A Hybrid Approach to Solve the Periodic Home Health Care Problem , 2007, OR.

[13]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

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