残疾人运输分析和优化研究
{É}tude pour l'analyse et l'optimisation du transport des personnes en situation de handicap
摘要：
从2010年起，由于医疗运输成本的增加，医疗运输已成为法国风险管理计划的十大优先事项之一。对于社会和医疗社会机构，这一费用是仅次于工资的第二项费用。在此背景下，NOMAd项目旨在全面改善人们从家到家的日常交通（MSI）。为此，我们建议在几个ESMS之间共享运输。这种运输的相互化使得在特定地理区域内收集和优化路线成为可能。挑战是在保持经济、社会和环境目标的同时改善经济业绩。从科学的角度来看，所研究的问题被称为时间一致的拨号乘车问题，目的是找到一个折衷的目标之间的运输成本和服务的一致性。鉴于问题的复杂性，我们首先寻求解决半天的问题。然后我们考虑整个星期。为了解决这些问题，我们使用大邻域搜索元启发式算法和基于集合覆盖问题的主问题。
英文摘要：
From 2010, the medical transport has become one of the top ten priorities of the risk management plan in France because of the increase in the cost. For social and medico-social institutions (MSI), this cost represents the second after that of the wages. In this context, the project NOMAd aims an overall improvement of the daily transport of people between their home and their (MSI). To this end, we propose the sharing of transport between several ESMS. This mutualization of transport makes possible to gather and optimize routes in a certain geographical area. The challenge is to improve economic performance while maintaining economic, social and environmental goals. From a scientific point of view, the studied problem is called the Time-Consistent-Dial-a-Ride Problem and aims to find a compromise between the objectives of the cost of transport and the consistency of the service. Given the complexity of the problem, we seek, first of all, to solve the problem for half a day. Then we consider the whole week. To solve these problems, we use the Large Neighborhood Search meta-heuristic and a master problem based on the Set Covering Problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
