首页> 外文会议>International Conference on Power Electronics and Intelligent Transportation System >Shortest Path Algorithm for Road Network with Traffic Restriction
【24h】

Shortest Path Algorithm for Road Network with Traffic Restriction

机译:交通限制道路网络最短路径算法

获取原文

摘要

Nowadays, with the increase of traffic demand, some regulation measures have been adopted to alleviate traffic congestion. The restrictions add difficulties to the search of shortest path problems of road network, and some classical algorithms can not be adopted to find a right route. Although some researchers have presented some algorithms, intelligent optimization methods are seldom seen. In this paper, in the light of the characteristic of traffic restriction network, from the perspective of algorithm, we present a general simulated annealing algorithm that can take into account all the restrictions of real network and find the optimal solution between any two nodes efficiently without changing its structure. Finally, the algorithm is applied to a given road network and shows a higher efficiency, which validates its availability.
机译:如今,随着交通需求的增加,已经采取了一些监管措施来缓解交通拥堵。限制增加了寻找道路网络最短路径问题的困难,并且不需要采用一些经典算法来找到正确的路线。虽然一些研究人员呈现了一些算法,但很少看到智能优化方法。本文鉴于交通限制网络的特征,从算法的角度来看,我们介绍了一个通用模拟退火算法,可以考虑真实网络的所有限制,并有效地在任何两个节点之间找到最佳解决方案改变其结构。最后,该算法应用于给定的道路网络并显示更高的效率,验证其可用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号