Skip to main content

Algorithm for Efficient and Sustainable Home Health Care Delivery Scheduling

  • Conference paper
  • First Online:
New Global Perspectives on Industrial Engineering and Management

Abstract

Central and Eastern European countries are lacking well-developed home care systems that would balance quality, equity and costs even more with the advancing population ageing. In this study we propose a home health care (HHC) routing and workforce scheduling algorithm, that considers a possibility of using electric bicycles instead of the currently used combination of public transport (buses) and walking. The coordination of aims, such the optimal allocation of care resources, the reduction of transport costs, sustainability and environmental awareness is tackled.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Albareda-Sambola, M., Van Der Vlerk, M. H., & Fernández, E. (2006). Exact solutions to a class of stochastic generalized assignment problems. European Journal of Operational Research, 173, 465–487.

    Article  MathSciNet  Google Scholar 

  • Amini, M. M., & Racer, M. (1995). A hybrid heuristic for the generalized assignment problem. European Journal of Operational Research, 87, 343–348.

    Article  Google Scholar 

  • Cattrysse, D. G., Salomon, M., & Van Wassenhove, L. N. (1994). A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research, 72, 167–174.

    Article  Google Scholar 

  • Cattrysse, D. G., & Van Wassenhove, L. N. (1992). A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60, 260–272.

    Article  Google Scholar 

  • Clausen, J. (1999). Branch and bound algorithms-principles and examples. Department of Computer Science, University of Copenhagen, 1–30.

    Google Scholar 

  • Eveborn, P., Flisberg, P., & Rönnqvist, M. (2006). Laps care—An operational system for staff planning of home care. European Journal of Operational Research, 171, 962–976.

    Article  Google Scholar 

  • Eveborn, P., Rönnqvist, M., Einarsdóttir, H., Eklund, M., Lidén, K., & Almroth, M. (2009). Operations research improves quality and efficiency in home care. Interfaces, 39, 18–34.

    Article  Google Scholar 

  • Fikar, C., & Hirsch, P. (2017). Home health care routing and scheduling: A review. Computers & Operations Research, 77, 86–95.

    Article  MathSciNet  Google Scholar 

  • Fisher, M. L., Jaikumar, R., & Van Wassenhove, L. N. (1986). A multiplier adjustment method for the generalized assignment problem. Management Science, 32, 1095–1103.

    Article  Google Scholar 

  • Genet, N., Boerma, W., Kroneman, M., Hutchinson, A., & Saltman, R. B. (2013). Home care across Europe: Current structure and future challenges. London: European Observatory on Health Systems and Policies.

    Google Scholar 

  • Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., & Raidl, G. R. (2015). Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central European Journal of Operations Research, 23, 89–113.

    Article  MathSciNet  Google Scholar 

  • Li, V., & Curry, G. L. (2005). Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. Computers & Operations Research, 32, 825–848.

    Article  Google Scholar 

  • Lorena, L. A. N., & Narciso, M. G. (1996). Relaxation heuristics for a generalized assignment problem. European Journal of Operational Research, 91, 600–610.

    Article  Google Scholar 

  • Martello, S., & Toth, P. (1981). An algorithm for the generalized assignment problem. Operational Research, 81, 589–603.

    MathSciNet  MATH  Google Scholar 

  • OECD. (2015). Health at a glance 2015: OECD indicators. Paris: OECD Publishing.

    Google Scholar 

  • Osorio, M. A. A., & Laguna, M. (2003). Logic cuts for multilevel generalized assignment problems. European Journal of Operational Research, 151, 238–246.

    Article  MathSciNet  Google Scholar 

  • Ribeiro, J. F., & Pradin, B. (1993). A methodology for cellular manufacturing design. The International Journal of Production Research, 31, 235–250.

    Article  Google Scholar 

  • Rietveld, P. (2000). Non-motorised modes in transport systems: A multimodal chain perspective for the Netherlands. Transportation Research Part D: Transport and Environment, 5, 31–36.

    Article  Google Scholar 

  • Ross, G. T., & Soland, R. M. (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming, 8, 91–103.

    Article  MathSciNet  Google Scholar 

  • Rouillon, S., Desaulniers, G., & Soumis, F. (2006). An extended branch-and-bound method for locomotive assignment. Transportation Research Part B: Methodological, 40, 404–423.

    Article  Google Scholar 

  • Trautsamwieser, A., Gronalt, M., & Hirsch, P. (2011). Securing home health care in times of natural disasters. OR Spectrum, 33, 787–813.

    Article  MathSciNet  Google Scholar 

  • Wegener, M., & Fürst, F. (1999). Land-use transport interaction: State of the art. Available at SSRN 1434678.

    Google Scholar 

  • Wirnitzer, J., Heckmann, I., Meyer, A., & Nickel, S. (2016). Patient-based nurse rostering in home care. Operations Research for Health Care, 8, 91–102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Szander .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Szander, N., Ros-McDonnell, L., de la Fuente, M.V. (2019). Algorithm for Efficient and Sustainable Home Health Care Delivery Scheduling. In: Mula, J., Barbastefano, R., Díaz-Madroñero, M., Poler, R. (eds) New Global Perspectives on Industrial Engineering and Management. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-93488-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93488-4_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93487-7

  • Online ISBN: 978-3-319-93488-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics