...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences
【24h】

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

机译:结合旅行者偏好的大规模路网划​​分与路径搜索方法研究

获取原文
           

摘要

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.
机译:结合改进的Pallottino并行算法,提出了一种考虑旅客的路线选择偏好的大规模路线搜索方法。有效地将城市道路网络分解为多层。该方法将广义行驶时间作为道路阻抗函数,利用面向对象的类定义,构建了一种新的多层多任务道路网络数据存储结构。然后,以广州市的真实道路网为例,对提出的路径搜索算法进行了验证。通过敏感的实验,我们对提出的路径搜索方法与当前先进的最优路径算法进行了比较分析。结果表明,该方法在不同的搜索比例请求,节点数和计算过程数的情况下,可以使路网搜索效率分别提高16%以上。因此,该方法是城市道路网引导领域的重大突破。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号