Skip to main content

A CP/LNS Approach for Multi-day Homecare Scheduling Problems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8457))

Abstract

Homecare, i.e., supportive care provided at the patients’ homes, is established as a prevalent alternative to unnecessary hospitalization or institutional care (e.g., in a rest home or a nursing home). These activities are provided either by healthcare professional or by non-medical caregivers, depending on the patient’s needs (e.g., medical care or just instrumental activities of daily living).

In this paper, we consider the problem of scheduling Homecare Activities, that is, determining the caregivers’ daily tours and the schedules of the homecare service to patients. We present a Constraint Programming (CP) formulation of the problem and we propose a Large Neighborhood Search method built upon the CP formulation.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Begur, S.V., Miller, D.M., Weaver, J.R.: An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 27(4), 35–48 (1997)

    Article  Google Scholar 

  2. Cheng, E., Rich, J.L.: A home health care routing and scheduling problem. Technical Report CAAM TR98–04, Rice University (1998)

    Google Scholar 

  3. Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research 219(3), 598–610 (2012)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: Combining heuristics for the home health care problem. Computers and Operations Research 33(10), 2866–2890 (2006)

    Article  MATH  Google Scholar 

  6. Rendl, A., Prandtstetter, M., Hiermann, G., Puchinger, J., Raidl, G.: Hybrid heuristics for multimodal homecare scheduling. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 339–355. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

    Google Scholar 

  8. Allaoua, H., Borne, S.: A matheuristic approach for solving a home health care problem. Electronic Notes in Discrete Mathematics 41, 471–478 (2013)

    Article  Google Scholar 

  9. Steeg, J., Schröder, M.: A hybrid approach to solve the periodic home health care problem. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007. Operations Research Proceedings, vol. 2007, pp. 297–302. Springer, Heidelberg (2008)

    Google Scholar 

  10. Nickel, S., Schröder, M., Steeg, J.: Mid-term and short-term planning support for home health care services. European Journal of Operational Research 219(3), 574–587 (2012)

    Article  MATH  Google Scholar 

  11. Kilby, P., Shaw, P.: Handbook of Constraint Programming: Vehicle Routing. Elsevier, New York (2006)

    Google Scholar 

  12. Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and Programming with Gecode (2014), http://www.gecode.org/doc-latest/MPG.pdf

  13. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics, pp. 399–419. Springer (2010)

    Google Scholar 

  15. Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515–530 (2004)

    Article  Google Scholar 

  16. Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics 8(1), 43–58 (2002)

    Article  MATH  Google Scholar 

  17. Urli, T.: json2run: a tool for experiment design & analysis. CoRR abs/1305.1112 (2013)

    Google Scholar 

  18. Birattari, M., Yuan, Z., Balaprakash, P., Stützle, T.: F-Race and iterated F-race: An overview. Springer, Berlin (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Di Gaspero, L., Urli, T. (2014). A CP/LNS Approach for Multi-day Homecare Scheduling Problems. In: Blesa, M.J., Blum, C., Voß, S. (eds) Hybrid Metaheuristics. HM 2014. Lecture Notes in Computer Science, vol 8457. Springer, Cham. https://doi.org/10.1007/978-3-319-07644-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07644-7_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07643-0

  • Online ISBN: 978-3-319-07644-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics