Skip to main content
SpringerLink
Log in

Clustering technique for large-scale home care crew scheduling problems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The Home Health Care Scheduling Problem involves allocating professional caregivers to patients’ places of residence to meet service demands. These services are regular in nature and must be provided at specific times during the week. In this paper, we present a heuristic with two tie-breaking mechanisms suitable for large-scale versions of the problem. The greedy algorithm merges service lots to minimize the accumulated unproductive time. As a result, the solution is restructured in such a way as to increase its efficiency. The approach is tested on a real-world large instance of the problem for a company whose current resource allocation is inefficient. The solutions are benchmarked against the current service assignment and those obtained by a Ward clustering algorithm, and the results show an improvement in efficiency and cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. EuroStat Population projections 2010-2060, 2011, online; accessed Apr 20, 2016. [Online]. Available: http://epp.eurostat.ec.europa.eu/cache/ITYPUBLIC/3-08062011-BP/EN/3-08062011-BP-EN.PDF

  2. Trautsamwieser A, Hirsch P (2011) Optimization of daily scheduling for home health care services. Journal of Applied Operational Research 3:124–136

    Google Scholar 

  3. Bard JF, Shao Y, Wang H (2013) Weekly scheduling models for traveling therapists. Socio Econ Plan Sci 47(3):191–204

    Article  Google Scholar 

  4. Benzarti E, Sahin E, Dallery Y (2013) Operations management applied to home care services: analysis of the districting problem. Decis Support Syst 55(2):587–598

    Article  Google Scholar 

  5. Nickel S, Schröder M., Steeg J (2012) Mid-term and short-term planning support for home health care services. Eur J Oper Res 219(3):574–587

    Article  MATH  Google Scholar 

  6. Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur J Oper Res 219(3):598–610

    Article  MATH  Google Scholar 

  7. Bard JF, Shao Y, Qi X, Jarrah AI (2014) The traveling therapist scheduling problem. IIE Trans (Institute of Industrial Engineers) 46(7):683–706

    Google Scholar 

  8. Mutingi M, Mbohwa C (2013) Home healthcare staff scheduling: A taxonomic state-of-the-art review. In: IEEE International conference on industrial engineering and engineering management (IEEM), pp 1107–1111

    Google Scholar 

  9. Redjem R, Marcon E Operations management in the home care services: a heuristic for the caregivers’ routing problem Flexible Services and Manufacturing Journal. In press

  10. Mutingi M, Mbohwa C (2014) A fuzzy particle swarm optimization approach for task assignment in home health care. In: Proceedings of the IEEE international conference on industrial Enegineering and engineering management, pp 1077–1081

  11. Masmoudi M, Mellouli R (2014) MILP For synchronized-mTSPTW: Application to home healthcare scheduling. In: Proceedings International Conference on Control, Decision and Information Technologies, CoDIT (2014), pp 297–302

  12. Cheng E, Lynn J (1998) A Home Health Care Routing and Scheduling Problem Technical report CAAM TR98–04 Rice University

    Google Scholar 

  13. Steeg J (2009) Mathematical models and algorithms for home health care services der andere verlag

  14. Bertels S, Fahle T (2006) A hybrid setup for a hybrid scenario: Combining heuristics for the home health care problem. Comput Oper Res 33(10):2866–2890

    Article  MATH  Google Scholar 

  15. Eveborn P, Flisberg P., Rönnqvist M (2006) Laps Care an operational system for staff planning of home care. Eur J Oper Res 171(3):962–976

    Article  MATH  Google Scholar 

  16. Rönnqvist M, Tragantalerngsak S, Holt J (1999) A repeated matching heuristic for the single-source capacitated facility location problem. Eur J Oper Res 116(1):51–68

    Article  MATH  Google Scholar 

  17. Akjiratikarl C, Yenradee P, Drake PR (2007) PSO-based algorithm for home care worker scheduling in the UK. Comput Ind Eng 53(4):559–583

    Article  Google Scholar 

  18. Rendl A, Prandtstetter M, Hiermann G, Puchinger J, Raidl GR (2012) Hybrid Heuristics for Multimodal Homecare Scheduling. In: Proceedings international conference on integration of artificial intelligence and operations research techniques in constraint programming, pp 339–355

  19. Carello G, Lanzarone E (2014) A cardinality-constrained robust model for the assignment problem in home care services. Eur J Oper Res 236(2):748–762

    Article  MathSciNet  MATH  Google Scholar 

  20. Maya Duque PA, Castro M, Sörensen K, Goos P (2015) Home care service planning. The case of Landelijke Thuiszorg. Eur J Oper Res 243(1):292–301

    Article  MATH  Google Scholar 

  21. Levary R (2015) An adaptive nurse home care scheduling system. Applications of Management Science 17:149–161

    Article  Google Scholar 

  22. Cattafi M, Herrero R, Gavanelli M, Nonato M, Malucelli F (2015) An application of constraint solving for home health care. AI Commun 28(2):215–237

    MathSciNet  MATH  Google Scholar 

  23. Ward JH (1963) Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association 58(301):236–244

    Article  MathSciNet  Google Scholar 

  24. Instituto Nacional de Estadística Encuesta Anual de Coste Laboral (EACL) 2015. http://www.ine.es/prensa/np983.pdf. Accessed 26 Sept 2016

Download references

Acknowledgments

The authors acknowledge financial support granted by the Spanish Ministry of Science and Innovation under grant TIN2011-28336 (MOVES).

Author information

Authors and Affiliations

  1. Department of Computer Science, Universidad Carlos III de Madrid, Av. de la Universidad 30, Leganes, Madrid, 28911, Spain

    David Quintana, Alejandro Cervantes, Yago Saez & Pedro Isasi

Authors
  1. David Quintana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alejandro Cervantes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yago Saez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pedro Isasi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Quintana.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Quintana, D., Cervantes, A., Saez, Y. et al. Clustering technique for large-scale home care crew scheduling problems. Appl Intell 47, 443–455 (2017). https://doi.org/10.1007/s10489-017-0908-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-017-0908-1

Keywords

Search

Navigation