IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v304y2021i1d10.1007_s10479-021-04061-9.html
   My bibliography  Save this article

An exact algorithm for the resource constrained home health care vehicle routing problem

Author

Listed:
  • Neda Tanoumand

    (University of Toronto)

  • Tonguç Ünlüyurt

    (Sabanci University)

Abstract

We consider a home health care routing problem with scarce resources which is a variation of the vehicle routing problem with resource constraints. In this problem, the services are provided by nurses and aids at patients’ homes. There are different types of patients that are categorized based on the services they demand and should be serviced by appropriate staff teams or single personnel where the teams are transported by rental vehicles. In this problem, the objective is to minimize the total transportation cost, by considering the patients’ requirements and the qualification of the staff, as well as the resource limitations. In this paper, we present a mathematical formulation of the problem that is modeled similar to a vehicle routing problem and propose a branch-and-price algorithm to solve it. Our proposed algorithm utilizes speed up techniques from the literature to enhance the effectiveness of the proposed solution method. A comprehensive computational study is conducted on Solomon based instances and the results illustrate the efficiency of the algorithm and the effective use of available resources.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:304:y:2021:i:1:d:10.1007_s10479-021-04061-9
    DOI: 10.1007/s10479-021-04061-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04061-9
    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/s10479-021-04061-9?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. 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.
    2. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
    3. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    4. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
    5. 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.
    6. Klaus-Dieter Rest & Patrick Hirsch, 2016. "Daily scheduling of home health care services using time-dependent public transport," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 495-525, September.
    7. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    8. Gerhard Hiermann & Matthias Prandtstetter & Andrea Rendl & Jakob Puchinger & Günther Raidl, 2015. "Metaheuristics for solving a multimodal home-healthcare scheduling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(1), pages 89-113, March.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Nikzad, Erfaneh & Bashiri, Mahdi & Abbasi, Babak, 2021. "A matheuristic algorithm for stochastic home health care planning," European Journal of Operational Research, Elsevier, vol. 288(3), pages 753-774.
    14. Roberto Baldacci & Paolo Toth & Daniele Vigo, 2010. "Exact algorithms for routing problems under vehicle capacity constraints," Annals of Operations Research, Springer, vol. 175(1), pages 213-245, March.
    15. Chen, Xi & Thomas, Barrett W. & Hewitt, Mike, 2016. "The technician routing problem with experience-based service times," Omega, Elsevier, vol. 61(C), pages 49-61.
    16. Dorota Mankowska & Frank Meisel & Christian Bierwirth, 2014. "The home health care routing and scheduling problem with interdependent services," Health Care Management Science, Springer, vol. 17(1), pages 15-30, March.
    17. 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.
    18. 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.
    19. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, May.
    20. Ines Mathlouthi & Michel Gendreau & Jean-Yves Potvin, 2021. "Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem," SN Operations Research Forum, Springer, vol. 2(1), pages 1-35, March.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. Mahyar Mirabnejad & Hadi Mohammadi & Mehrdad Mirzabaghi & Amir Aghsami & Fariborz Jolai & Maziar Yazdani, 2022. "Home Health Care Problem with Synchronization Visits and Considering Samples Transferring Time: A Case Study in Tehran, Iran," IJERPH, MDPI, vol. 19(22), pages 1-25, November.
    3. 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.
    4. 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.
    5. 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.
    6. Gang Du & Xi Liang & Chuanwang Sun, 2017. "Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows," Sustainability, MDPI, vol. 9(2), pages 1-22, February.
    7. Yadav, Niteesh & Tanksale, Ajinkya, 2022. "An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1100-1125.
    8. 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.
    9. Amir M. Fathollahi-Fard & Abbas Ahmadi & Behrooz Karimi, 2021. "Multi-Objective Optimization of Home Healthcare with Working-Time Balancing and Care Continuity," Sustainability, MDPI, vol. 13(22), pages 1-33, November.
    10. Li, Yanfeng & Xiang, Ting & Szeto, Wai Yuen, 2021. "Home health care routing and scheduling problem with the consideration of outpatient services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    11. Filipe Alves & Lino A. Costa & Ana Maria A. C. Rocha & Ana I. Pereira & Paulo Leitão, 2022. "The Sustainable Home Health Care Process Based on Multi-Criteria Decision-Support," Mathematics, MDPI, vol. 11(1), pages 1-19, December.
    12. Ehsan Pourjavad & Eman Almehdawe, 2022. "Optimization of the technician routing and scheduling problem for a telecommunication industry," Annals of Operations Research, Springer, vol. 315(1), pages 371-395, August.
    13. Shima Azizi & Özge Aygül & Brenton Faber & Sharon Johnson & Renata Konrad & Andrew C. Trapp, 2023. "Select, route and schedule: optimizing community paramedicine service delivery with mandatory visits and patient prioritization," Health Care Management Science, Springer, vol. 26(4), pages 719-746, December.
    14. 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.
    15. 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.
    16. Lin, Meiyan & Ma, Lijun & Ying, Chengshuo, 2021. "Matching daily home health-care demands with supply in service-sharing platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    17. Cinar, Ahmet & Salman, F. Sibel & Bozkaya, Burcin, 2021. "Prioritized single nurse routing and scheduling for home healthcare services," European Journal of Operational Research, Elsevier, vol. 289(3), pages 867-878.
    18. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    19. 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).
    20. 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.

    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:annopr:v:304:y:2021:i:1:d:10.1007_s10479-021-04061-9. 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.