arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.04832cs.DS
收藏

UnLimited转换器在多模式路径规划中的应用

UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution

Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf

摘要:

我们研究了由公共交通网络和表示二级交通模式的换乘图(例如,步行、骑自行车、电动滑板车)。我们的目标是计算帕累托最优行程的到达时间和使用的公共交通出行的数量。虽然现有的各种算法可以有效地计算纯公共交通网络或纯换乘图中的最佳行程,但将两者结合起来会显着增加运行时间。因此,现有的方法通常仅通过施加最大转移距离或通过要求转移图传递闭合来支持在停靠点之间的有限行走。为了克服这些缺点,我们提出了一种新的预处理技术,称为ULTRA(无限TRAnsfers):给定一个无限的传输图,这可能代表任何非基于时间表的交通模式,ULTRA计算少量的传输捷径,可证明足以计算帕累托集的最佳行程。这些换乘快捷方式可以集成到各种最先进的公共交通算法中,从而建立ULTRA-Query算法系列。我们广泛的实验评估表明,ULTRA提高了这些算法从有限到无限的传输,而不牺牲查询速度。这不仅适用于步行,也适用于更快的交通方式,如自行车或汽车。与现有的多式联运行程规划相比,最快的基于ULTRA的算法实现了一个数量级的加速。

英文摘要:

We study a multimodal journey planning scenario consisting of a public transit network and a transfer graph which represents a secondary transportation mode (e.g., walking, cycling, e-scooter). The objective is to compute Pareto-optimal journeys with respect to arrival time and the number of used public transit trips. While various existing algorithms can efficiently compute optimal journeys in either a pure public transit network or a pure transfer graph, combining the two increases running times significantly. Existing approaches therefore typically only support limited walking between stops, either by imposing a maximum transfer distance or by requiring the transfer graph to be transitively closed. To overcome these shortcomings, we propose a novel preprocessing technique called ULTRA (UnLimited TRAnsfers): Given an unlimited transfer graph, which may represent any non-schedule-based transportation mode, ULTRA computes a small number of transfer shortcuts that are provably sufficient for computing a Pareto set of optimal journeys. These transfer shortcuts can be integrated into a variety of state-of-the-art public transit algorithms, establishing the ULTRA-Query algorithm family. Our extensive experimental evaluation shows that ULTRA improves these algorithms from limited to unlimited transfers without sacrificing query speed. This is true not just for walking, but also for faster transfer modes such as bicycle or car. Compared to the state of the art for multimodal journey planning, the fastest ULTRA-based algorithm achieves a speedup of an order of magnitude.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑