The application of Adaptive Large Neighborhood Search in Home Health Care Routing and Scheduling problem

Authors

  • Le Minh Thao Nguyen Vietnam National University Ho Chi Minh City image/svg+xml
  • Nguyen Ky Phuc Phan Vietnam National University Ho Chi Minh City image/svg+xml
  • Hoai Phuong Le Ho Chi Minh City University of Technology image/svg+xml

DOI:

https://doi.org/10.4108/eetsmre.9928

Keywords:

Home Health Care, Routing and Scheduling, Adaptive Large Neighborhood Search

Abstract

Due to an aging population, a significant increase in demand for Home Health Care (HHC) services in most developed and developing countries. This paper addresses the considerations of costs including transportation cost, caregiver’s cost and patients’ load. To mitigate the issue, the objective is to minimize the costs and considerate the patient's load. The resource is defined as an arrangement for patient’s load. The deterministic model is solved by CPLEX, and the Adaptive Large Neighborhood Search based on heuristics.

References

[1] Bazirha M., Abdeslam Kadrani, Rachid Benmansour (2023). Stochastic home health care routing and scheduling problem with multiple synchronize services. Annals of Operational Research, 320, 573-601. https://doi.org/10.1007/s10479-021-04222-w.

[2] Burke, E. K., De Causmaecker, P., Berghe, G. V., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441–499.

[3] Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Science, 39(1), 104–118. 10.1287/trsc.1030.0056

[4] Journal article: Liu, R., Yuan, B., & Jiang, Z. (2018). A branch-and-price algorithm for the homecaregiver scheduling and routing problem with stochastic travel and service times. Flexible Services and Manufacturing Journal, 31, 989–1011. https://doi.org/10.1007/s10696-018-9328-8.

[5] Mankowska, D. S., Meisel, F., & Bierwirth, C. (2014). The home health care routing and scheduling problem with interdependent services. Health Care Management Science, 17(1), 15–30. https://doi.org/10.1007/s10729-013-9243-1.

[6] Pahlevani, D., Abbasi, B., Hearne, J. W., & Eberhard, A. (2022). A cluster-based algorithm for home health care planning: A case study in Australia. Transportation Research Part E Logistics and Transportation Review, 166, 102878. https://doi.org/10.1016/j.tre.2022.102878.

[7] Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational. http://dx.doi.org/10.1016/j.ejor.2011.10.048.

[8] Shi, Y., Boudouh, T., Grunder, O.,& Wang,D.(2018). Modelling and solving simultaneous delivery and pick-up problem with stochastic travel and service times in home health care. Expert Systems with Applications, 102, 218-233. https://doi.org/10.1016/j.eswa.2018.02.025.

[9] Tarricone, R., & Tsouros, A.D (2008). Home care in Europe: the solid facts. WHO Regional Office Europe.

[10] Yuan, B., Liu, R., & Jiang, Z. (2015). A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements. International Journal of Production Research, 53(24) 74650-7464. https://doi.org/10.1080/00207543.2015.1082041.

Downloads

Published

02-03-2026

How to Cite

1.
Nguyen LMT, Phan NKP, Le HP. The application of Adaptive Large Neighborhood Search in Home Health Care Routing and Scheduling problem. EAI Endorsed Sust Man Ren Energy [Internet]. 2026 Mar. 2 [cited 2026 Mar. 2];3(1). Available from: https://publications.eai.eu/index.php/sumare/article/view/9928