Home Health Care Daily Planning Considering the Satisfaction of all the Stakeholders

Nowadays, the aging population and the growth of life expectancy lead to an increase of people experiencing frailty and therefore loss of autonomy. As there are not enough places available in specialized institutions, an alternative is Home Health Care (HHC) services. The HHC structure is willing to optimize the scheduling of the requested care services by satisfying the requirements of patients, the preferences of caregivers, and by balancing the workload among the different caregivers. The purpose of this paper is to propose a metaheuristic-oriented formulation and a simulated annealing algorithm for generating an optimal short-term (daily) routing and scheduling solution to reach maximum satisfaction among stakeholders (patients and caregivers) in an HHC system. With this method computed on a real-world dataset, we obtained satisfying scheduling solutions.

[1]  Hamid Allaoui,et al.  A Multi-objective Modelling to Human Resource Assignment and Routing Problem for Home Health Care Services , 2015 .

[2]  Marie-Laure Espinouse,et al.  Continuity of care in home services: a client-centered heuristic for the home health care routing and scheduling problem , 2018, 2018 5th International Conference on Control, Decision and Information Technologies (CoDIT).

[3]  Chuanwang Sun,et al.  Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows , 2017 .

[4]  Rabeh Redjem,et al.  Operations management in the home care services: a heuristic for the caregivers’ routing problem , 2016 .

[5]  Christian Bierwirth,et al.  The home health care routing and scheduling problem with interdependent services , 2014, Health care management science.

[6]  Matthias Prandtstetter,et al.  Metaheuristics for solving a multimodal home-healthcare scheduling problem , 2015, Central Eur. J. Oper. Res..

[7]  Bertha Maya Sopha,et al.  Comparison study of metaheuristics , 2017 .

[8]  Danielle Azar,et al.  A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem , 2011, CATA.

[9]  Syrine Roufaida Ait Haddadene,et al.  Modèles et méthodes pour la gestion logistique optimisée dans le domaine des services et de la santé. (Models and optimization approaches for logistic problems in health care systems and services sector) , 2016 .

[10]  Didier Gourc,et al.  Plas'O'Soins: An Interactive ICT Platform to Support Care Planning and Coordination within Home-Based Care , 2019 .

[11]  Patrick Hirsch,et al.  A Branch‐Price‐and‐Cut approach for solving the medium‐term home health care planning problem , 2014, Networks.

[12]  Zhenzhen Zhang,et al.  A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints , 2018, Eur. J. Oper. Res..

[13]  Mohamed Cissé Modèles mathématiques et algorithmes pour la résolution du problème de tournées du personnel de soins à domicile , 2017 .

[14]  Marcel Mongeau,et al.  Simulated Annealing: From Basics to Applications , 2018, Handbook of Metaheuristics.

[15]  Ran Liu,et al.  A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements , 2015 .

[16]  Jonathan F. Bard,et al.  The therapist routing and scheduling problem , 2012 .

[17]  Klaus-Dieter Rest,et al.  Daily scheduling of home health care services using time-dependent public transport , 2016 .