The assignment-dial-a-ride-problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Health Care Management Science Année : 2023

The assignment-dial-a-ride-problem

Résumé

In this paper, we present the first Assignment-Dial-A-Ride problem motivated by a real-life problem faced by medico-social institutions in France. Every day, disabled people use ride-sharing services to go to an appropriate institution where they receive personal care. These institutions have to manage their staff to meet the demands of the people they receive. They have to solve three interconnected problems: the routing for the ride-sharing services; the assignment of disabled people to institutions; and the staff size in the institutions. We formulate a general Assignment-Dial-A-Ride problem to solve all three at the same time. We first present a matheuristic that iteratively generates routes using a large neighborhood search in which these routes are selected with a mixed integer linear program. After being validated on two special cases in the literature, the matheuristic is applied to real instances in three different areas in France. Several managerial results are derived. In particular, it is found that the amount of cost reduction induced by the people assignment is equivalent to the amount of cost reduction induced by the sharing of vehicles between institutions.
Fichier principal
Vignette du fichier
The_Assignment_Dial_A_Ride_Problem (1).pdf (524.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04401502 , version 1 (19-01-2024)

Identifiants

Citer

Chane-Haï Timothée, Vercraene Samuel, Monteiro Thibaud. The assignment-dial-a-ride-problem. Health Care Management Science, 2023, 26 (4), pp.770-784. ⟨10.1007/s10729-023-09655-2⟩. ⟨hal-04401502⟩
23 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More