基于ULTRA的多模式公交交通流优化计算
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA
摘要:
我们研究了在多模式环境中计算公共交通分配的问题:给定公共交通时间表,一个额外的无限制换乘模式(在我们的情况下是步行),以及一组起点-目的地对,我们的目标是计算网络中每辆车的利用率。虽然已经表明,考虑不受限制的转移可以显着改善旅程,但有效地计算此类旅程仍然具有算法挑战性。由于交通分配需要计算数百万条最短路径,因此使用多模式网络以前是不可行的。最近提出的方法(ULTRA),使高效的算法与无限的TRAnsfers在一个短的预处理阶段的成本。在这项工作中,我们结合了ULTRA的方法与国家的最先进的分配算法,使多模态分配实用。仔细的算法工程导致一个新的公共交通交通分配算法,甚至优于它所建立的算法,同时实现以前没有考虑过的无限步行。我们结束了我们的工作与广泛的评价算法,显示其多功能性和效率。在我们的真实世界实例中,该算法在不到17秒的时间内计算了超过1500万次独特的旅程。
英文摘要:
We study the problem of computing public transit traffic assignments in a multi-modal setting: Given a public transit timetable, an additional unrestricted transfer mode (in our case walking), and a set of origin-destination pairs, we aim to compute the utilization of every vehicle in the network. While it has been shown that considering unrestricted transfers can significantly improve journeys, computing such journeys efficiently remains algorithmically challenging. Since traffic assignments require the computation of millions of shortest paths, using a multi-modal network has previously not been feasible. A recently proposed approach (ULTRA) enables efficient algorithms with UnLimited TRAnsfers at the cost of a short preprocessing phase. In this work we combine the ULTRA approach with a state-of-the-art assignment algorithm, making multi-modal assignments practical. Careful algorithm engineering results in a new public transit traffic assignment algorithm that even outperforms the algorithm it builds upon, while enabling unlimited walking which has not been considered previously. We conclude our work with an extensive evaluation of the algorithm, showing its versatility and efficiency. On our real world instance, the algorithm computes over 15 million unique journeys in less than 17 seconds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。