A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times
- 119 Downloads
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.
KeywordsHome health care Home-caregiver Scheduling Routing Branch-and-price Stochastic time
This work is supported by National Natural Science Foundation of China (71672112).
- 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
- Trautsamwieser A, Hirsch P (2011) Optimization of daily scheduling for home health care services. J Appl Oper Res 3(3):124–136Google 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, BerlinGoogle Scholar