大规模动态道路网络中的快速路径
Fast paths in large-scale dynamic road networks
摘要:
在大规模动态道路网络(其中动态交通信息在网络的一部分上是已知的)中有效地计算快速路径是希望向启用GPS终端的车辆提供现实快速路径计算的若干交通信息服务提供商所面临的实际问题。我们提出的启发式求解方法是基于公路层次结构的最短路径算法的静态大规模网络,我们保持一个静态的公路层次结构,并执行每个查询的动态评估网络。
英文摘要:
Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。