IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v31y2019i4d10.1007_s10696-018-9328-8.html
   My bibliography  Save this article

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

Author

Listed:
  • Ran Liu

    (Shanghai Jiao Tong University)

  • Biao Yuan

    (Shanghai Jiao Tong University)

  • Zhibin Jiang

    (Shanghai Jiao Tong University)

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.

Suggested Citation

  • Ran Liu & Biao Yuan & Zhibin Jiang, 2019. "A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times," Flexible Services and Manufacturing Journal, Springer, vol. 31(4), pages 989-1011, December.
    • Handle: RePEc:spr:flsman:v:31:y:2019:i:4:d:10.1007_s10696-018-9328-8
    DOI: 10.1007/s10696-018-9328-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-018-9328-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-018-9328-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rasmussen, Matias Sevel & Justesen, Tor & Dohn, Anders & Larsen, Jesper, 2012. "The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies," European Journal of Operational Research, Elsevier, vol. 219(3), pages 598-610.
    2. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Chris T., 2015. "The load-dependent vehicle routing problem and its pick-up and delivery extension," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 158-181.
    3. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    4. Nickel, Stefan & Schröder, Michael & Steeg, Jörg, 2012. "Mid-term and short-term planning support for home health care services," European Journal of Operational Research, Elsevier, vol. 219(3), pages 574-587.
    5. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    6. Biao Yuan & Ran Liu & Zhibin Jiang, 2015. "A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7450-7464, December.
    7. Ran Liu & Biao Yuan & Zhibin Jiang, 2017. "Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 558-575, January.
    8. Salani, Matteo & Vacca, Ilaria, 2011. "Branch and price for the vehicle routing problem with discrete split deliveries and time windows," European Journal of Operational Research, Elsevier, vol. 213(3), pages 470-477, September.
    9. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    10. Yufen Shao & Jonathan Bard & Ahmad Jarrah, 2012. "The therapist routing and scheduling problem," IISE Transactions, Taylor & Francis Journals, vol. 44(10), pages 868-893.
    11. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    12. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    13. Desaulniers, Guy & Lavigne, June & Soumis, Francois, 1998. "Multi-depot vehicle scheduling problems with time windows and waiting costs," European Journal of Operational Research, Elsevier, vol. 111(3), pages 479-494, December.
    14. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zheng, Chenyang & Wang, Shuming & Li, Ningxin & Wu, Yuanhao, 2021. "Stochastic joint homecare service and capacity planning with nested decomposition approaches," European Journal of Operational Research, Elsevier, vol. 295(1), pages 203-222.
    2. Zhan, Yang & Wang, Zizhuo & Wan, Guohua, 2021. "Home service routing and appointment scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 98-110.
    3. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Biao Yuan & Zhibin Jiang, 2017. "Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
    2. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    3. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    4. Gang Du & Luyao Zheng & Xiaoling Ouyang, 2019. "Real-time scheduling optimization considering the unexpected events in home health care," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 196-220, January.
    5. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    6. Mohammed Bazirha & Abdeslam Kadrani & Rachid Benmansour, 2023. "Stochastic home health care routing and scheduling problem with multiple synchronized services," Annals of Operations Research, Springer, vol. 320(2), pages 573-601, January.
    7. Biao Yuan & Ran Liu & Zhibin Jiang, 2015. "A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7450-7464, December.
    8. Jamal Abdul Nasir & Chuangyin Dang, 2018. "Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection," Sustainability, MDPI, vol. 10(1), pages 1-22, January.
    9. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    10. Jamal Abdul Nasir & Chuangyin Dang, 2020. "Quantitative thresholds based decision support approach for the home health care scheduling and routing problem," Health Care Management Science, Springer, vol. 23(2), pages 215-238, June.
    11. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    12. Federica Bomboi & Christoph Buchheim & Jonas Pruente, 2022. "On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency," 4OR, Springer, vol. 20(2), pages 217-239, June.
    13. Paola Cappanera & Maria Grazia Scutellà, 2022. "Addressing consistency and demand uncertainty in the Home Care planning problem," Flexible Services and Manufacturing Journal, Springer, vol. 34(1), pages 1-39, March.
    14. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    15. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    16. de Aguiar, Ana Raquel Pena & Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel, 2023. "Home care routing and scheduling problem with teams’ synchronization," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    17. Jalel Euchi & Malek Masmoudi & Patrick Siarry, 2022. "Home health care routing and scheduling problems: a literature review," 4OR, Springer, vol. 20(3), pages 351-389, September.
    18. Zhan, Yang & Wang, Zizhuo & Wan, Guohua, 2021. "Home service routing and appointment scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 98-110.
    19. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
    20. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:flsman:v:31:y:2019:i:4:d:10.1007_s10696-018-9328-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.