arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.01326math.OCcs.DM
收藏

公共交通中的价格最优路径规划

Price Optimal Routing in Public Transportation

Ricardo Euler, Niels Lindner, Ralf Borndörfer

AI总结:

针对公共交通价格最优最早到达问题,提出条件票价网络(CFNs)框架以建模复杂票价结构,并适配MCRAP算法实现平均400毫秒内求最优解。

摘要:

我们考虑公共交通中的价格最优最早到达问题(POEAP),旨在针对公共交通网络中的票价和到达时间,计算相应的 Pareto 最优路径集合。公共交通票价结构通常是多种票价策略的组合,例如基于距离的票价、基于区域的票价或单一票价。决定实际票价的规则通常非常复杂。因此,票价结构出了名地难以建模,因为通常仅将成本分配给路径图中的弧是不够的。对 POEAP 的研究很少,通常要么依赖启发式方法,要么仅考虑限制性太强的票价模型,无法涵盖大多数实际应用的全貌。因此,我们引入了条件票价网络(CFNs),这是首个能够表示大量真实世界票价结构的框架。我们证明,通过放宽标签支配准则,CFNs 可用作标签设定多目标最短路径算法的构建模块。由于其广泛的建模能力,在 CFNs 上进行优化是 NP 困难的。然而,我们证明,将多标准 RAPTOR(MCRAP)算法适配于 CFNs,可得到一种能在真实数据集上平均不到 400 毫秒内将 POEAP 求解至最优的算法。通过限制 Pareto 集的大小,运行时间进一步降至 10 毫秒以下。

英文摘要:

We consider the price-optimal earliest arrival problem in public transit (POEAP) in which we aim to calculate the Pareto-set of journeys with respect to ticket price and arrival time in a public transportation network. Public transit fare structures are often a combination of various fare strategies such as, e.g., distance-based fares, zone-based fares or flat fares. The rules that determine the actual ticket price are often very complex. Accordingly, fare structures are notoriously difficult to model, as it is in general not sufficient to simply assign costs to arcs in a routing graph. Research into POEAP is scarce and usually either relies on heuristics or only considers restrictive fare models that are too limited to cover the full scope of most real-world applications. We therefore introduce conditional fare networks (CFNs), the first framework for representing a large number of real-world fare structures. We show that by relaxing label domination criteria, CFNs can be used as a building block in label-setting multi-objective shortest path algorithms. By the nature of their extensive modeling capabilities, optimizing over CFNs is NP-hard. However, we demonstrate that adapting the multi-criteria RAPTOR (MCRAP) algorithm for CFNs yields an algorithm capable of solving POEAP to optimality in less than 400 ms on average on a real-world data set. By restricting the size of the Pareto-set, running times are further reduced to below 10 ms.

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

↑