Univ Lyon, INSA Lyon, Université Claude Bernard Lyon 1, Univ Lyon 2, DISP-UR4570, 21 avenue Jean Capelle, Villeurbanne, 69621, Auvergne Rhone-Alpes, France.
Health Care Manag Sci. 2023 Dec;26(4):770-784. doi: 10.1007/s10729-023-09655-2. Epub 2023 Oct 21.
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.
在本文中，我们提出了第一个受法国医社机构面临的实际问题启发的任务分配叫车问题。每天，残疾人使用拼车服务前往适当的机构接受个人护理。这些机构必须管理他们的员工以满足他们所接待的人的需求。他们必须解决三个相互关联的问题：拼车服务的路线规划；残疾人到机构的分配；以及机构中的员工规模。我们制定了一个通用的任务分配叫车问题来同时解决这三个问题。我们首先提出了一种启发式算法，该算法使用大邻域搜索来迭代生成路线，其中这些路线是使用混合整数线性规划选择的。在文献中的两个特殊案例上进行验证后，启发式算法应用于法国三个不同地区的实际实例。得出了几个管理结果。特别是，发现人员分配引起的成本降低量与机构之间车辆共享引起的成本降低量相当。
