A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times

  • Ran LiuEmail author
  • Biao Yuan
  • Zhibin Jiang


This paper addresses the solution methods for the stochastic home-caregiver scheduling and routing problem which arises in many service industries such as home care and home health care. In the problem, the caregiver’s travel times and service times for customers are stochastic. A chance constraint is introduced to ensure the on-time service probability for the customers. Such stochastic travelling and service time and the chance constraint further complicate the problem. In this paper, a route-based mathematical model is introduced. A branch-and-price (B&P) algorithm and a discrete approximation method are combined to solve the problem. Herein, effective label algorithms are designed to generate negative reduced cost routes. The efficiency of the algorithm are improved by employing three acceleration strategies. The experiments on test instances validate the performances of the proposed B&P algorithm and demonstrate the necessity of considering the stochasticity of travel times of home-caregiver and service times to the customers.


Home health care Home-caregiver Scheduling Routing Branch-and-price Stochastic time 



This work is supported by National Natural Science Foundation of China (71672112).


  1. Athanasopoulos T, Minis I (2013) Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework. Ann Oper Res 206(1):1–22MathSciNetCrossRefGoogle Scholar
  2. Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269–1283MathSciNetCrossRefGoogle Scholar
  3. Bertels S, Fahle T (2006) A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput Oper Res 33(10):2866–2890CrossRefGoogle Scholar
  4. Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper Res Lett 34(1):58–68MathSciNetCrossRefGoogle Scholar
  5. Cissé M et al (2017) OR problems related to Home Health Care: a review of relevant routing and scheduling problems. Oper Res Health Care 13–14:1–22Google Scholar
  6. Dayarian I et al (2015a) A branch-and-price approach for a multi-period vehicle routing problem. Comput Oper Res 55:167–184MathSciNetCrossRefGoogle Scholar
  7. Dayarian I et al (2015b) A column generation approach for a multi-attribute vehicle routing problem. Eur J Oper Res 241(3):888–906MathSciNetCrossRefGoogle Scholar
  8. Desaulniers G, Lavigne J, Soumis F (1998) Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur J Oper Res 111(3):479–494CrossRefGoogle Scholar
  9. Ehmke JF, Campbell AM, Urban TL (2015) Ensuring service levels in routing problems with time windows and stochastic travel times. Eur J Oper Res 240(2):539–550MathSciNetCrossRefGoogle Scholar
  10. Eveborn P, Flisberg P, Rönnqvist M (2006) Laps Care—an operational system for staff planning of home care. Eur J Oper Res 171(3):962–976CrossRefGoogle Scholar
  11. Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8(4):407–424MathSciNetCrossRefGoogle Scholar
  12. Fikar C, Hirsch P (2017) Home health care routing and scheduling: a review. Comput Oper Res 77:86–95MathSciNetCrossRefGoogle Scholar
  13. Lanzarone E, Matta A (2014) Robust nurse-to-patient assignment in home care services to minimize overtimes under continuity of care. Oper Res Health Care 3(2):48–58CrossRefGoogle Scholar
  14. Lanzarone E, Matta A, Sahin E (2012) Operations management applied to home care services: the problem of assigning human resources to patients. IEEE Trans Syst Man Cybern Part A Syst Hum 42(6):1346–1363CrossRefGoogle Scholar
  15. Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125(1):137–145CrossRefGoogle Scholar
  16. Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9(1):49–82MathSciNetCrossRefGoogle Scholar
  17. Liu R, Yuan B, Jiang Z (2017) Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements. Int J Prod Res 55(2):558–575CrossRefGoogle Scholar
  18. Nickel S, Schröder M, Steeg J (2012) Mid-term and short-term planning support for home health care services. Eur J Oper Res 219(3):574–587CrossRefGoogle Scholar
  19. OECD (2017) Health at a Glance 2017: OECD Indicators. OECD Publishing, Paris. CrossRefGoogle Scholar
  20. Polacek M et al (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heurist 10(6):613–627CrossRefGoogle Scholar
  21. Rasmussen MS et al (2012) The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur J Oper Res 219(3):598–610CrossRefGoogle Scholar
  22. Shao Y, Bard JF, Jarrah AI (2012) The therapist routing and scheduling problem. IIE Trans 44(10):868–893CrossRefGoogle Scholar
  23. Trautsamwieser A, Hirsch P (2011) Optimization of daily scheduling for home health care services. J Appl Oper Res 3(3):124–136Google Scholar
  24. Trautsamwieser A, Gronalt M, Hirsch P (2011) Securing home health care in times of natural disasters. OR Spectr 33(3):787–813MathSciNetCrossRefGoogle Scholar
  25. Vidal T et al (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40(1):475–489MathSciNetCrossRefGoogle Scholar
  26. Yalçındağ S, Matta A (2017). A decomposition approach for the home health care problem with time windows. In: International conference on health care systems engineering. Springer, BerlinGoogle Scholar
  27. Yalçındağ S et al (2016) The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers. Flex Serv Manuf J 28(1–2):304–335CrossRefGoogle Scholar
  28. Yuan B, Liu R, Jiang Z (2015) A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements. Int J Prod Res 53(24):7450–7464CrossRefGoogle Scholar
  29. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2015) The load-dependent vehicle routing problem and its pick-up and delivery extension. Transp Res Part B Methodol 71:158–181CrossRefGoogle Scholar
  30. Zhang J, Lam WH, Chen BY (2013) A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service. Netw Spat Econ 13(4):471–496MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Industrial Engineering and ManagementShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations