The Dial-A-Ride Problem with Transfers
The Dial-A-Ride Problem with Transfers
复制标题
DOI：
10.1016/j.cor.2013.07.020
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
R. Masson;Fabien Lehuédé;Olivier Péton
中科院分区：
文献类型：
--
作者：
R. Masson;Fabien Lehuédé;Olivier Péton
转乘拨号问题 (DARPT) 在于定义一组路线，在存在乘车时间限制的情况下，满足用户在一组取货点和一组送货点之间的交通请求。用户可以在旅途中更换车辆。这种车辆的更换称为换乘，是在称为换乘点的特定位置进行的。解决 DARPT 涉及建模和算法困难。在本文中，我们提供了一种基于自适应大邻域搜索（ALNS）元启发式的解决方法，并解释了如何检查请求插入的可行性。该方法在现实生活和生成的实例上进行评估。实验表明，在现实生活中，由于转账而节省的成本最高可达 8%。
The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8% on real-life instances.