Problème de tournées de véhicules avec contraintes de synchronisation dans le cadre de structures de maintien à domicile. Formalisation mathématique et hybridation à base de métaheuristique

摘要

We are interested in a routing problem within the context of home health care. The cares are provided by one or two caregivers with the required type at the patient’s home during the patients’ availability. A type is doctor or nurse for instance. Each patient is characterized by a dependency level and may give a preference for a caregiver. The goal is to construct the tour for each caregiver visiting all patients, minimizing the length of the tours, balancing the workload of the caregivers and maximizing the satisfaction of the patients. We present a state of the art of the home health care problem. Then we propose two mathematical models of our problem based on the multiple Traveling Salesman Problem with Time Windows (m-TSPTW) with specific constraints like the activities’s synchronization or ressources’ type. The performance criteria are specific of our problem : workload balancing and patients’ satisfaction. We then propose approached methods based on combination between Metaheuristics and simulation model. This méthods have been tested on dataset from the literature and dataset adapted to our problem. We conclude with three research perspectives :- the reorganization of the tours when a caregiver is not available,- the integration of stochastic transport time,- the location of home support structure and its impact on the routes’ construction.