Skip to main content

Advertisement

SpringerLink
Log in

Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Home healthcare and home care centers are facing increasing demands and costs all over the world. Researchers are attracted by several organizational issues related to home care centers’ activities, in particular by the daily routing and scheduling issue. The challenge is to deal with the assignment of visits to home caregivers and the design of sequences of visits execution, minimizing several objective functions separately such as traveling time, preferences and workload balance. This problem is presented in the literature as a vehicle routing problem with synchronization and time window constraints. A benchmark is available, and two efficient metaheuristics have been provided in the literature: a simulated annealing based algorithm (SA-ILS) and an adaptive large neighborhood search (ALNS). In this paper, new metaheuristics; a genetic algorithm, several variants of variable neighborhood descent: three nested and two mixed, and a hybrid genetic algorithm, are provided. Considering fairness as objective function, numerical results show the superiority of the two mixed variable neighborhood descent and the hybrid genetic algorithm, in comparison to SA-ILS and ALNS. Considering preference and traveling time as objective functions, numerical results show that the two mixed variable neighborhood descent outperform the SA-ILS and are competitive with the ALNS.

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

Similar content being viewed by others

References

  1. Aazami, A., Saidi-Mehrabad, M.: An optimization model for heterogeneous vehicle routing and scheduling problem with fixed cost and green reverse logistics network using genetic algorithm. J. Optim. Ind. Eng. (2019). https://doi.org/10.22094/JOIE.2018.563565.1552

    Article  Google Scholar 

  2. Afifi, S., Dang, D-C., Moukrim, A.: A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints. In: International Conference on Learning and Intelligent Optimization, pp. 259–265. Springer (2013)

  3. Afifi, S., Dang, D.-C., Moukrim, A.: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optim. Lett. 10(3), 511–525 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5), 787–800 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Berger, J., Barkaoui, M.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 31(12), 2037–2053 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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 (1997)

    Article  Google Scholar 

  7. Benzarti, E.: Home Health Care Operations Management: Applying the districting approach to Home Health Care, Ph.D. thesis, Ecole Centrale Paris (2012)

  8. Bredström, D., Rönnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. 191(1), 19–31 (2008)

    Article  MATH  Google Scholar 

  9. Cissé, M., Yalçındaǧ, S., Kergosien, Y., çahin, E., Lenté, C., Matta, A.: OR problems related to Home Health Care: a review of relevant routing and scheduling problems. Oper. Res. Health Care 13, 1–22 (2017)

    Google Scholar 

  10. Da Silva, G.C., Bahiense, L., Ochi, L.S., Oswaldo Boaventura-Netto, P.: The dynamic space allocation problem: applying hybrid GRASP and Tabu search metaheuristics. Comput. Oper. Res. 39(3), 671–677 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Decerle, J., Grunder, O., Hajjam El Hassani, A., Barakat, O.: A memetic algorithm for a home health care routing and scheduling problem. Oper. Res. Health Care 16, 59–71 (2018)

    Article  MATH  Google Scholar 

  12. Derbel, H., Jarboui, B., Hanafi, S., Chabchoub, H.: Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. 39(3), 2865–2871 (2012) 73-86. Springer International Publishing (2014)

  13. Di Mascolo, M., Espinouse, M. L., Ozkan, C. E.: Synchronization between human resources in Home Health Care context. In: Proceedings of the International Conference on Health Care Systems Engineering, pp. 73–86. Springer, Cham (2014)

  14. Di Mascolo, M., Martinez, C., Espinouse, M.L.: Routing and scheduling in home health care: a literature survey and bibliometric analysis. Comput. Ind. Eng. 158, 107255 (2021)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. Euchi, J., Masmoudi, M., Siarry, P.: Home health care routing and scheduling problems: a literature review. 4OR 20(3), 351–389 (2022)

    Article  MathSciNet  Google Scholar 

  18. Fikar, C., Hirsch, P.: Home health care routing and scheduling: a review. Comput. Oper. Res. 77, 86–95 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  19. Frifita, S., Masmoudi, M., Euchi, J.: General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits. Electron Notes Discrete Math 58, 63–70 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  20. Frifita, S., Masmoudi, M.: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties. Int. Trans. Oper. Res. 27, 291–313 (2020)

    Article  MathSciNet  Google Scholar 

  21. Gayraud. F.: Probleme de tournées de véhicules avec contraintes de synchronisation dans le cadre de structures de maintien a domicile. Formalisation mathématique et hybridation a base de métaheuristique. Thesis report. University of Blaise Pascal - Clermont-Ferrand II (2015)

  22. Haddadene, S.R.A., Labadie, N., Prodhon, C.: A GRASP \(\times \) ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. Expert Syst. Appl. 66, 274–294 (2016)

    Article  Google Scholar 

  23. Haitam, E., Najat, R., Jaafar, A.: A survey of the vehicle routing problem in-home health care services. Proc. Eng. 3(4), 391–404 (2021)

    Google Scholar 

  24. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–67 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  25. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  26. Hulshof, P.J.H., Kortbeek, N., Boucherie, R.J., Hans, E.W., Bakker, P.J.M.: Taxonomic classification of planning decisions in health care: a structured review of the state of the art in OR/MS. Health Syst. 1, 129–175 (2012)

    Article  Google Scholar 

  27. Jarboui, B., Derbel, H., Hanafi, S., Mladenović, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40(1), 47–57 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  28. Kergosien, Y., Lente, C., Billaut, J.C.: Home health care problem: An extended multiple Traveling Salesman Problem. In: Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 85–92 (2009)

  29. Lanzaronee, E., Matta, A., Scaccabarozzi, G.: A patient stochastic model to support human resource planning in home care. Product. Plann. Control 21(1), 3–25 (2010)

    Article  Google Scholar 

  30. Li, Y., Xiang, T., Szeto, W.Y.: Home health care routing and scheduling problem with the consideration of outpatient services. Transp. Res. Part E Logist. Transp. Rev. 152, 102420 (2021)

    Article  Google Scholar 

  31. Labadie, N. Prins, C., Yang, Y.: Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints, In: Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, pp. 257–263 (2014)

  32. Liu, R., Tao, Y., Xie, X.: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Comput. Oper. Res. 101, 250–262 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  33. Liu, W., Dridi, M., Fei, H., El Hassani, A.H.: Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks. Expert Syst. Appl. 187, 115307 (2021)

    Article  Google Scholar 

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

    Article  Google Scholar 

  35. Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)

    Article  Google Scholar 

  36. Masmoudi, M., Mellouli, R.: MILP for Synchronized-mTSPTW: application to Home HealthCare Scheduling. In: International Conference on Control, Decision and Information Technologies CODIT’2014, pp. 297–302 (2014)

  37. Mjirda, A., Todosijević, R., Hanafi, S., Hansen, P., Mladenović, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Int. Res., 1475–3995 (2016)

  38. Murata, T., Ishibuchi, H.: Performance evaluation of genetic algorithms for flow shop scheduling problems. In: International Conference on Evolutionary Computation, pp. 812–817 (1994)

  39. 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(3), 598–610 (2012)

    Article  MATH  Google Scholar 

  40. Salhi, S.: Heuristic Search: The Emerging Science of Problem Solving. Springer, Berlin (2017)

    Book  Google Scholar 

  41. Saxena, R., Jain, M., Kumar, A., Jain, V., Sadana, T., Jaidka, S.: An improved genetic algorithm based solution to vehicle routing problem over open MP with load consideration. In: Advances in Communication, Devices and Networking, pp. 285–296. Springer, Singapore (2019)

  42. Todosijević, R.: Theoretical and practical contributions on scatter search, variable neighborhood search and metaheuristics for 0–1 mixed integer programs, thesis report. Valenciennes, France (2015)

  43. Volna, E.: Genetic algorithms for the vehicle routing problem. In: AIP Conference Proceedings, vol. 1738, No 1, pp. 120002 (2016)

Download references

Author information

Authors and Affiliations

  1. College of Engineering, University of Sharjah, Sharjah, United Arab Emirates

    Malek Masmoudi

  2. University Jean Monnet, Saint-Etienne, France

    Malek Masmoudi

  3. Higher Colleges of Technology, Abu Dhabi, United Arab Emirates

    Bassem Jarboui

  4. Laboratory MODILS, Faculty of Economics and Management of Sfax, University of Sfax, Sfax, Tunisia

    Rahma Borchani

Authors
  1. Malek Masmoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bassem Jarboui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rahma Borchani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Malek Masmoudi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Masmoudi, M., Jarboui, B. & Borchani, R. Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits. Optim Lett 17, 2135–2167 (2023). https://doi.org/10.1007/s11590-023-02006-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02006-8

Keywords

Search

Navigation