arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.12592cs.DScs.AIcs.RO
收藏

公共交通路由的早期剪枝

Early Pruning for Public Transport Routing

Department of Computer Science and Engineering, University of New South Wales (UNSW), Sydney, NSW 2033, Australia(新南威尔士大学计算机科学与工程系);Department of Data Science and Artificial Intelligence, Monash University, Melbourne, Australia(墨尔本大学数据科学与人工智能系)

Andrii Rohovyi, Abdallah Abuaisha, Toby Walsh

AI总结:

提出早期剪枝技术,通过预排序换乘连接并在换乘循环中应用剪枝规则,在不影响最优性的情况下加速公共交通路由算法,实验表明查询时间最多减少57%。

摘要:

公共交通的路由算法,特别是广泛使用的RAPTOR及其变体,在支持无限换乘时,常常在换乘松弛阶段面临性能瓶颈,尤其是在密集的换乘图上。这种低效源于遍历许多潜在的站点间连接(步行、自行车、电动滑板车等)。为了保持可接受的性能,从业者通常限制换乘距离或排除某些换乘选项,这可能会降低路径的最优性并限制向旅客展示的多模式选项。本文介绍了早期剪枝,一种低开销的技术,可以在不影响最优性的情况下加速路由算法。通过按持续时间预排序换乘连接,并在换乘循环内应用剪枝规则,该方法在站点处丢弃较长的换乘,一旦它们无法产生比当前最佳解更早的到达时间。早期剪枝可以以最小的更改集成到现有代码库中,并且只需要一次预处理步骤。该技术在扩展准则设置中保持帕累托最优性,只要额外的优化准则在换乘持续时间上单调非递减。在多个基于RAPTOR的最新解决方案中,包括RAPTOR、ULTRA-RAPTOR、McRAPTOR、BM-RAPTOR、ULTRA-McRAPTOR和UBM-RAPTOR,并在瑞士和伦敦交通网络上测试,我们实现了高达57%的查询时间减少。该方法为交通路径查找算法的效率提供了可推广的改进。

英文摘要:

Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially on dense transfer graphs, when supporting unlimited transfers. This inefficiency arises from iterating over many potential inter-stop connections (walks, bikes, e-scooters, etc.). To maintain acceptable performance, practitioners often limit transfer distances or exclude certain transfer options, which can reduce path optimality and restrict the multimodal options presented to travellers. This paper introduces Early Pruning, a low-overhead technique that accelerates routing algorithms without compromising optimality. By pre-sorting transfer connections by duration and applying a pruning rule within the transfer loop, the method discards longer transfers at a stop once they cannot yield an earlier arrival than the current best solution. Early Pruning can be integrated with minimal changes to existing codebases and requires only a one-time preprocessing step. The technique preserves Pareto-optimality in extended-criteria settings whenever the additional optimization criteria are monotonically non-decreasing in transfer duration. Across multiple state-of-the-art RAPTOR-based solutions, including RAPTOR, ULTRA-RAPTOR, McRAPTOR, BM-RAPTOR, ULTRA-McRAPTOR, and UBM-RAPTOR and tested on the Switzerland and London transit networks, we achieved query time reductions of up to 57\%. This approach provides a generalizable improvement to the efficiency of transit pathfinding algorithms.

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

↑