Operations management in the home care services: a heuristic for the caregivers’ routing problem
| Autor: | Eric Marcon, Rabeh Redjem |
|---|---|
| Přispěvatelé: | Laboratoire d'Ingénierie des Systèmes Mécaniques et des MAtériaux (LISMMA), Université Paris 8 Vincennes-Saint-Denis (UP8)-SUPMECA - Institut supérieur de mécanique de Paris (SUPMECA), Décision et Information pour les Systèmes de Production (DISP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2) |
| Rok vydání: | 2015 |
| Předmět: |
Mathematical optimization
Heuristic (computer science) Computer science 0211 other engineering and technologies heuristics 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering Scheduling (computing) Time windows Health care 0202 electrical engineering electronic engineering information engineering Operations management scheduling 021103 operations research business.industry mathematical modeling [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] Real size routing Order (business) 020201 artificial intelligence & image processing Routing (electronic design automation) home care business Heuristics |
| Zdroj: | Flexible Services and Manufacturing Journal Flexible Services and Manufacturing Journal, Springer, 2016, 28 (1-2), pp.280-303. ⟨10.1007/s10696-015-9220-8⟩ |
| ISSN: | 1936-6590 1936-6582 |
| DOI: | 10.1007/s10696-015-9220-8 |
| Popis: | International audience; Home Care Services (HCS) aim at providing complex coordinated health care for patients at their homes. This paper addresses the challenges of routing and scheduling HCS caregivers under precedence and coordination constraints, with patients receiving multiple caregivers. Moreover, the visits are performed simultaneously and possibly in a predefined order. The routing problem involves a fleet of vehicles to serve a number of customers at different locations. The objective is to find the minimal round for vehicle, while satisfying all the customers and without violating customers' time windows. It has been proved that the complexity of the caregivers routing problem is linked to both (1) the number of care activities per caregiver ratio and (2) the temporal dependencies rate. Given the poor performance of the mathematical modeling based on exact approaches, a heuristic approach called the Caregivers Routing Heuristic (CRH) has been developed and tested using real size instances. In fact, the exact approaches are not able to solve real size instances. The performance of the CRH has been evaluated using real size instances. The numerical results show that the CRH is very efficient in terms of computation times. Otherwise, the CRH is less sensitive than the exact approaches to both complexity axes: the temporal dependencies constraints and the ratio of the number of care activities per caregiver. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink