Skip to main content
SpringerLink
Log in

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

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • 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–22

    Article  MathSciNet  Google Scholar 

  • Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269–1283

    Article  MathSciNet  Google Scholar 

  • 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–2890

    Article  Google Scholar 

  • 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–68

    Article  MathSciNet  Google Scholar 

  • 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–22

    Google Scholar 

  • Dayarian I et al (2015a) A branch-and-price approach for a multi-period vehicle routing problem. Comput Oper Res 55:167–184

    Article  MathSciNet  Google Scholar 

  • Dayarian I et al (2015b) A column generation approach for a multi-attribute vehicle routing problem. Eur J Oper Res 241(3):888–906

    Article  MathSciNet  Google Scholar 

  • 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–494

    Article  Google Scholar 

  • 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–550

    Article  MathSciNet  Google Scholar 

  • 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–976

    Article  Google Scholar 

  • Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8(4):407–424

    Article  MathSciNet  Google Scholar 

  • Fikar C, Hirsch P (2017) Home health care routing and scheduling: a review. Comput Oper Res 77:86–95

    Article  MathSciNet  Google Scholar 

  • 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–58

    Article  Google Scholar 

  • 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–1363

    Article  Google Scholar 

  • 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–145

    Article  Google Scholar 

  • Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9(1):49–82

    Article  MathSciNet  Google Scholar 

  • 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–575

    Article  Google Scholar 

  • 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–587

    Article  Google Scholar 

  • OECD (2017) Health at a Glance 2017: OECD Indicators. OECD Publishing, Paris. https://doi.org/10.1787/health_glance-2017-en

    Book  Google Scholar 

  • Polacek M et al (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heurist 10(6):613–627

    Article  Google Scholar 

  • 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–610

    Article  Google Scholar 

  • Shao Y, Bard JF, Jarrah AI (2012) The therapist routing and scheduling problem. IIE Trans 44(10):868–893

    Article  Google Scholar 

  • Trautsamwieser A, Hirsch P (2011) Optimization of daily scheduling for home health care services. J Appl Oper Res 3(3):124–136

    Google Scholar 

  • Trautsamwieser A, Gronalt M, Hirsch P (2011) Securing home health care in times of natural disasters. OR Spectr 33(3):787–813

    Article  MathSciNet  Google Scholar 

  • 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–489

    Article  MathSciNet  Google Scholar 

  • 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, Berlin

    Google Scholar 

  • 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–335

    Article  Google Scholar 

  • 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–7464

    Article  Google Scholar 

  • 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–181

    Article  Google Scholar 

  • 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–496

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China

    Ran Liu, Biao Yuan & Zhibin Jiang

Authors
  1. Ran Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Biao Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhibin Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ran Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, R., Yuan, B. & Jiang, Z. A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times. Flex Serv Manuf J 31, 989–1011 (2019). https://doi.org/10.1007/s10696-018-9328-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-018-9328-8

Keywords

Search

Navigation