A multi-criteria large neighbourhood search for the transportation of disabled people
A multi-criteria large neighbourhood search for the transportation of disabled people
复制标题
残疾人交通的多标准大型社区搜索
DOI：
--
复制
发表时间：
2014
影响因子：
3.6
通讯作者：
Fabien Tricoire
中科院分区：
文献类型：
--
作者：
Fabien Lehuédé;R. Masson;Sophie N. Parragh;Olivier Péton;Fabien Tricoire
本文解决了优化残疾人从家到专门中心或学校的交通问题。它被建模为一个叫车问题 (DARP)，其中几个人共享同一目的地。特别强调目标函数，以考虑几个潜在的利益冲突。我们提出了基于 Choquet 积分的多属性效用理论的多标准模型。然后使用大型邻域搜索算法求解生成的多标准 DARP。该方法包括经典的破坏和修复启发法以及利用共享目的地特征的新算子和特定于标准的算子。该算法在医疗保健物流领域的一组 14 个真实实例上进行评估，其中最多有 200 个请求和 51 个目的地点。
This paper addresses the problem of optimizing the transportation of disabled persons from home to specialized centres or schools. It is modelled as a Dial-a-ride problem (DARP), where several people share the same destination. Particular emphasis is placed on the objective function in order to consider several potentially conflicting interests. We propose a multi-criteria model from Multi-attribute Utility Theory based on the Choquet integral. The resulting multi-criteria DARP is then solved with a large neighbourhood search algorithm. This method includes classical destroy and repair heuristics as well as new operators exploiting the shared destination feature and criterion-specific operators. The algorithm is evaluated on a set of 14 real-world instances in the field of health care logistics, with up to 200 requests and 51 destination points.