Scheduling Home Hospice Care with Logic-Based Benders Decomposition | SpringerLink
Skip to main content
Springer Nature Link
Log in

Scheduling Home Hospice Care with Logic-Based Benders Decomposition

  • Conference paper
  • First Online:
Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2016)

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

  • 1764 Accesses

Abstract

We propose an exact optimization method for home hospice care staffing and scheduling, using logic-based Benders decomposition (LBBD). The objective is to match hospice care aides with patients and schedule visits to patient homes, so as to maximize the number of patients serviced by available staff, while meeting requirements of the patient plan of care and scheduling constraints imposed by the patients and the staff. The Benders master problem assigns aides to patients and days of the week and is solved by mixed integer programming (MIP). The routing and scheduling subproblem decouples by aide and day of the week and is solved by constraint programming. We report preliminary computational results for problem instances obtained from a major hospice care provider. We find that LBBD is superior to state-of-the-art MIP and solves problems of realistic size, if the aim is to conduct staff planning on a rolling basis while maintaining continuity of the care arrangement for patients currently receiving service.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Similar content being viewed by others

References

  1. Hertz, A., Lahrichi, N.: A patient assignment algorithm for home care service. J. Oper. Res. Soc. 60, 481–495 (2009)

    Article  MATH  Google Scholar 

  2. Trautsamwieser, A., Hirsch, P.: Optimization of daily scheduling for home health care services. J. Appl. Oper. Res. 3, 124–136 (2011)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Ciré, A., Hooker, J.N.: A heuristic logic-based Benders method for the home health care problem. Presented at Matheuristics 2012, Angra dos Reis, Brazil (2012)

    Google Scholar 

  5. 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 

  6. Allaoua, H., Borne, S., Létocart, L., Calvo, R.W.: A matheuristic approach for solving a home health care problem. Electron. Notes Discrete Math. 41, 471–478 (2013)

    Article  Google Scholar 

  7. Cappanera, P., Scutellà, M.G.: Joint assignment, scheduling and routing models to home care optimization: a pattern-based approach. Transp. Sci. 49, 830–852 (2014)

    Article  Google Scholar 

  8. Yalçındağ, S., Matta, A., Şahin, E., Shanthikumar, J.G.: A two-stage approach for solving assignment and routing problems in home health care services. In: Matta, A., Li, J., Sahin, E., Lanzarone, E., Fowler, J. (eds.) Proceedings of the International Conference on Health Care Systems Engineering. Proceedings in Mathematics and Statistics, vol. 61, pp. 47–59. Springer, New York (2014)

    Chapter  Google Scholar 

  9. Mankowska, D.S., Meisel, F., Bierwirth, C.: The home health care routing and scheduling problem with interdependent services. Health Care Manage. Sci. 17, 15–30 (2014)

    Article  Google Scholar 

  10. Rest, K.D., Hirsch, P.: Daily scheduling of home health care services using time-dependent public transport. Flexible Services and Manufacturing Journal (published online 2015)

    Google Scholar 

  11. Dohn, A., Kolind, E., Clausen, J.: The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput. Oper. Res. 36, 1145–1157 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Chahed, S., Marcon, E., Sahin, E., Feillet, D., Dallery, Y.: Exploring new operational research opportunities within the home care context: the chemotherapy at home. Health Care Manage. Sci. 12, 179–191 (2009)

    Article  Google Scholar 

  14. Hooker, J.N.: Logic-based Benders decomposition. In: INFORMS National Meeting (1995)

    Google Scholar 

  15. Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Hentenryck, P.V. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267–288. MIT Press, Cambridge (1995)

    Google Scholar 

  16. Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)

    Book  MATH  Google Scholar 

  17. Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96, 33–60 (2003)

    MathSciNet  MATH  Google Scholar 

  18. Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55, 588–602 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hooker, J.N.: A hybrid method for planning and scheduling. Constraints 10, 385–401 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139–157 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ciré, A., Çoban, E., Hooker, J.N.: Logic-based Benders decomposition for planning and scheduling: a computational analysis. In: Barták, R., Salido, M.A. (eds.) COPLAS Proceedings, pp. 21–29 (2015)

    Google Scholar 

  23. Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13, 258–276 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Harjunkoski, I., Grossmann, I.E.: Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26, 1533–1552 (2002)

    Article  Google Scholar 

  25. Harjunkoski, I., Grossmann, I.E.: A decomposition approach for the scheduling of a steel plant production. Comput. Chem. Eng. 25, 1647–1660 (2001)

    Article  Google Scholar 

  26. Liu, W., Gu, Z., Xu, J., Wu, X., Ye, Y.: Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 22, 1382–1389 (2011)

    Article  Google Scholar 

  27. Lombardi, M., Milano, M., Ruggiero, M., Benini, L.: Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip. J. Sched. 13, 315–345 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  28. Cambazard, H., Hladik, P.-E., Déplanche, A.-M., Jussien, N., Trinquet, Y.: Decomposition and learning for a hard real time task allocation problem. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 153–167. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  29. Chu, Y., Xia, Q.: Generating Benders cuts for a class of integer programming problems. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 127–141. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  30. Maravelias, C.T., Grossmann, I.E.: Using MILP and CP for the scheduling of batch chemical processes. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 1–20. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  31. Maravelias, C.T., Grossmann, I.E.: A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Comput. Chem. Eng. 28, 1921–1949 (2004)

    Article  Google Scholar 

  32. Terekhov, D., Beck, J.C., Brown, K.N.: Solving a stochastic queueing design and control problem with constraint programming. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), vol. 1, pp. 261–266. AAAI Press (2007)

    Google Scholar 

  33. Benini, L., Bertozzi, D., Guerri, A., Milano, M.: Allocation and scheduling for MPSoCs via decomposition and no-good generation. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 107–121. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  34. Ciré, A., Coban, E., Hooker, J.N.: Mixed integer programming vs. logic-based Benders decomposition for planning and scheduling. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 325–331. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  35. Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P., Soumis, F.: Vehicle routing with time windows: optimization and approximation. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 65–84. North-Holland, Amsterdam (1988)

    Google Scholar 

  36. Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27–36 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  37. Cordeau, J.F., Laporte, G., Savelsbergh, M., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Handbook in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier, Amsterdam (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Compassionate Care Hospice Group, New York, USA

    Aliza Heching

  2. Carnegie Mellon University, Pittsburgh, USA

    John N. Hooker

Authors
  1. Aliza Heching
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John N. Hooker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John N. Hooker .

Editor information

Editors and Affiliations

  1. Université Laval, Quebec, Québec, Canada

    Claude-Guy Quimper

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Heching, A., Hooker, J.N. (2016). Scheduling Home Hospice Care with Logic-Based Benders Decomposition. In: Quimper, CG. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2016. Lecture Notes in Computer Science(), vol 9676. Springer, Cham. https://doi.org/10.1007/978-3-319-33954-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33954-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33953-5

  • Online ISBN: 978-3-319-33954-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics