IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v288y2021i3p753-774.html
   My bibliography  Save this article

A matheuristic algorithm for stochastic home health care planning

Author

Listed:
  • Nikzad, Erfaneh
  • Bashiri, Mahdi
  • Abbasi, Babak

Abstract

Efficient human resource planning is the cornerstone of designing an effective home health care system. Human resource planning in home health care system consists of decisions on districting/zoning, staff dimensioning, resource assignment, scheduling, and routing. In this study, a two-stage stochastic mixed integer model is proposed that considers these decisions simultaneously. In the planning phase of a home health care system, the main uncertain parameters are travel and service times. Hence, the proposed model takes into account the uncertainty in travel and service times. Districting and staff dimensioning are defined as the first stage decisions, and assignment, scheduling, and routing are considered as the second stage decisions. A novel algorithm is developed for solving the proposed model. The algorithm consists of four phases and relies on a matheuristic-based method that calls on various mixed integer models. In addition, an algorithm based on the progressive hedging and Frank and Wolf algorithms is developed to reduce the computational time of the second phase of the proposed matheuristic algorithm. The efficiency and accuracy of the proposed algorithm are tested through several numerical experiments. The results prove the ability of the algorithm to solve large instances.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:288:y:2021:i:3:p:753-774
    DOI: 10.1016/j.ejor.2020.06.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172030583X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.06.040?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. Yves Crama & Mahmood Rezaei & Martin Savelsbergh & Tom Van Woensel, 2018. "Stochastic Inventory Routing for Perishable Products," Transportation Science, INFORMS, vol. 52(3), pages 526-546, June.
    2. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando & Toledo, Franklina M.B., 2014. "A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company," European Journal of Operational Research, Elsevier, vol. 237(2), pages 729-737.
    3. Andersen, Anders Reenberg & Nielsen, Bo Friis & Reinhardt, Line Blander & Stidsen, Thomas Riis, 2019. "Staff optimization for time-dependent acute patient flow," European Journal of Operational Research, Elsevier, vol. 272(1), pages 94-105.
    4. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    5. Maya Duque, P.A. & Castro, M. & Sörensen, K. & Goos, P., 2015. "Home care service planning. The case of Landelijke Thuiszorg," European Journal of Operational Research, Elsevier, vol. 243(1), pages 292-301.
    6. M Blais & S D Lapierre & G Laporte, 2003. "Solving a home-care districting problem in an urban setting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1141-1147, November.
    7. Oliveira, Beatriz B. & Carravilla, Maria Antónia & Oliveira, José F. & Costa, Alysson M., 2019. "A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem," European Journal of Operational Research, Elsevier, vol. 276(2), pages 637-655.
    8. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    9. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
    10. Guido, Rosita & Groccia, Maria Carmela & Conforti, Domenico, 2018. "An efficient matheuristic for offline patient-to-bed assignment problems," European Journal of Operational Research, Elsevier, vol. 268(2), pages 486-503.
    11. Claudia Archetti & Natashia Boland & Grazia Speranza, 2017. "A Matheuristic for the Multivehicle Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 377-387, August.
    12. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    13. 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.
    14. 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.
    15. Grenouilleau, Florian & Legrain, Antoine & Lahrichi, Nadia & Rousseau, Louis-Martin, 2019. "A set partitioning heuristic for the home health care routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 295-303.
    16. Carello, Giuliana & Lanzarone, Ettore, 2014. "A cardinality-constrained robust model for the assignment problem in Home Care services," European Journal of Operational Research, Elsevier, vol. 236(2), pages 748-762.
    17. Biao Yuan & Ran Liu & Zhibin Jiang, 2018. "Daily scheduling of caregivers with stochastic times," International Journal of Production Research, Taylor & Francis Journals, vol. 56(9), pages 3245-3261, May.
    18. C. Rodriguez & T. Garaix & X. Xie & V. Augusto, 2015. "Staff dimensioning in homecare services with uncertain demands," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7396-7410, December.
    19. Mohamed Fatah Cisse & Semih Yalçındag & 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.
    20. Li, Yantong & Chu, Feng & Chu, Chengbin & Zhu, Zhanguo, 2019. "An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing," European Journal of Operational Research, Elsevier, vol. 272(3), pages 914-927.
    21. Hernández-Leandro, Noberto A. & Boyer, Vincent & Salazar-Aguilar, M. Angélica & Rousseau, Louis-Martin, 2019. "A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 272(3), pages 859-867.
    22. Semih Yalçındag & Paola Cappanera & Maria Grazia Scutellà & Evren Sahin & Andrea Matta, 2016. "Pattern-based decompositions for human resource planning in home health care services," Post-Print hal-01736734, HAL.
    23. Shi, Yong & Boudouh, Toufik & Grunder, Olivier, 2019. "A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 52-95.
    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. 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).
    2. 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.
    3. Restrepo, María I. & Rousseau, Louis-Martin & Vallée, Jonathan, 2020. "Home healthcare integrated staffing and scheduling," Omega, Elsevier, vol. 95(C).
    4. Cappanera, Paola & Scutellà, Maria Grazia & Nervi, Federico & Galli, Laura, 2018. "Demand uncertainty in robust Home Care optimization," Omega, Elsevier, vol. 80(C), pages 95-110.
    5. Grenouilleau, Florian & Legrain, Antoine & Lahrichi, Nadia & Rousseau, Louis-Martin, 2019. "A set partitioning heuristic for the home health care routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 295-303.
    6. Biao Yuan & Zhibin Jiang, 2017. "Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem," Sustainability, MDPI, Open Access Journal, vol. 9(12), pages 1-15, November.
    7. 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.
    8. Isabel Méndez-Fernández & Silvia Lorenzo-Freire & Ignacio García-Jurado & Julián Costa & Luisa Carpente, 2020. "A heuristic approach to the task planning problem in a home care business," Health Care Management Science, Springer, vol. 23(4), pages 556-570, December.
    9. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    10. Shi, Yong & Boudouh, Toufik & Grunder, Olivier, 2019. "A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 52-95.
    11. Mustafa Demirbilek & Juergen Branke & Arne Strauss, 2019. "Dynamically accepting and scheduling patients for home healthcare," Health Care Management Science, Springer, vol. 22(1), pages 140-155, March.
    12. Gomes, Maria Isabel & Ramos, Tânia Rodrigues Pereira, 2019. "Modelling and (re-)planning periodic home social care services with loyalty and non-loyalty features," European Journal of Operational Research, Elsevier, vol. 277(1), pages 284-299.
    13. 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.
    14. 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.
    15. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    16. 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.
    17. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    18. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2021. "Inventory routing under stochastic supply and demand," Omega, Elsevier, vol. 102(C).
    19. Alarcon Ortega, Emilio J. & Schilde, Michael & Doerner, Karl F., 2020. "Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries," Operations Research Perspectives, Elsevier, vol. 7(C).
    20. Mosquera, Federico & Smet, Pieter & Vanden Berghe, Greet, 2019. "Flexible home care scheduling," Omega, Elsevier, vol. 83(C), pages 80-95.

    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:eee:ejores:v:288:y:2021:i:3:p:753-774. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: http://www.elsevier.com/locate/eor .

    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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.