IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i4d10.1057_palgrave.jors.2602574.html
   My bibliography  Save this article

A patient assignment algorithm for home care services

Author

Listed:
  • A Hertz

    (École Polytechnique de Montréal)

  • N Lahrichi

    (École Polytechnique de Montréal)

Abstract

We consider the problem of assigning patients to nurses for home care services. The aim is to balance the workload of the nurses while avoiding long travels to visit the patients. We analyse the case of the CSSS Côte-des-Neiges, Métro and Parc Extension for which a previous analysis has shown that demand fluctuations may create work overload for the nursing staff. We propose a mixed integer programming model with some non-linear constraints and a non-linear objective which we solve using a Tabu Search algorithm. A simplification of the workload measure leads to a linear mixed integer program which we optimize using CPLEX.

Suggested Citation

  • A Hertz & N Lahrichi, 2009. "A patient assignment algorithm for home care services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 481-495, April.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602574
    DOI: 10.1057/palgrave.jors.2602574
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602574
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602574?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. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    2. Bezalel Gavish & Hasan Pirkul, 1991. "Algorithms for the Multi-Resource Generalized Assignment Problem," Management Science, INFORMS, vol. 37(6), pages 695-713, June.
    3. C Mullinax & M Lawley, 2002. "Assigning patients to nurses in neonatal intensive care," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(1), pages 25-35, January.
    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. 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.
    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. David Bogataj & Marija Bogataj & Samo Drobne, 2022. "Long-Term Care Sustainable Networks in ADRION Region," Sustainability, MDPI, vol. 14(18), pages 1-23, September.
    4. 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.
    5. Aliza Heching & J. N. Hooker & Ryo Kimura, 2019. "A Logic-Based Benders Approach to Home Healthcare Delivery," Transportation Science, INFORMS, vol. 53(2), pages 510-522, March.
    6. Restrepo, María I. & Rousseau, Louis-Martin & Vallée, Jonathan, 2020. "Home healthcare integrated staffing and scheduling," Omega, Elsevier, vol. 95(C).
    7. Mike Hewitt & Maciek Nowak & Nisha Nataraj, 2016. "Planning Strategies for Home Health Care Delivery," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-26, October.
    8. Naderi, Bahman & Begen, Mehmet A. & Zaric, Gregory S. & Roshanaei, Vahid, 2023. "A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty," Omega, Elsevier, vol. 116(C).
    9. 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.
    10. 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.
    11. 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.
    12. Mustafa Demirbilek & Juergen Branke & Arne K. Strauss, 2021. "Home healthcare routing and scheduling of multiple nurses in a dynamic environment," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 253-280, March.

    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. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    2. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    3. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    4. Duraikannan Sundaramoorthi & Victoria Chen & Jay Rosenberger & Seoung Kim & Deborah Buckley-Behan, 2010. "A data-integrated simulation-based optimization for assigning nurses to patient admissions," Health Care Management Science, Springer, vol. 13(3), pages 210-221, September.
    5. Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
    6. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    8. Maria Cremers & Willem Klein Haneveld & Maarten Vlerk, 2009. "A two-stage model for a day-ahead paratransit planning problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 69(2), pages 323-341, May.
    9. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    10. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    11. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    12. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    13. Labelle, A. & Langevin, A. & Campbell, J. F., 2002. "Sector design for snow removal and disposal in urban areas," Socio-Economic Planning Sciences, Elsevier, vol. 36(3), pages 183-202, September.
    14. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    15. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
    16. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.
    17. Hong Zhang & Heng Li & C. M. Tam, 2006. "Heuristic scheduling of resource-constrained, multiple-mode and repetitive projects," Construction Management and Economics, Taylor & Francis Journals, vol. 24(2), pages 159-169.
    18. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
    19. Johannes Vass & Marie-Louise Lackner & Christoph Mrkvicka & Nysret Musliu & Felix Winter, 2022. "Exact and meta-heuristic approaches for the production leveling problem," Journal of Scheduling, Springer, vol. 25(3), pages 339-370, June.
    20. Gavish, Bezalel, 1997. "Low earth orbit satellite based communication systems -- Research opportunities," European Journal of Operational Research, Elsevier, vol. 99(1), pages 166-179, May.

    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:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602574. 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.palgrave-journals.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.