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

交通网络中的路径规划

Route Planning in Transportation Networks

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck

摘要:

我们调查的最新进展,在交通网络中的路线规划算法。对于道路网络,我们表明,即使在大陆尺度上,也可以在毫秒或更短的时间内计算驾驶方向。各种技术在预处理工作量、空间需求和查询时间之间提供了不同的权衡。一些算法可以在几分之一微秒内回答查询,而另一些算法可以有效地处理实时流量。公共交通系统的行程规划,虽然概念上类似,是一个非常困难的问题,由于其固有的时间依赖性和多准则的性质。虽然精确算法对于大城市交通系统的交互式查询来说足够快,但处理大陆大小的实例需要简化或大量的预处理。多模式路线规划问题寻求将基于时间表的交通(公共汽车,火车)与不受限制的模式(步行,驾驶)相结合的旅程,甚至更难,甚至依赖于大都市输入的近似解决方案。

英文摘要:

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.

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

↑