期刊文献+

基于实时信息的车辆导航路由算法 被引量:1

Vehicle routing algorithm based on real-time information
下载PDF
导出
摘要 讨论了在动态随机网基于实时信息的车辆导航问题。交通网中的每一路段的旅行时间建模为随机变量,可以在车辆进入路段前根据实时信息估计其旅行时间。与经典最短路径算法不同的是,不需要在车辆行驶前就确定一条从起始点到终点的完整固定的路径,只需要在车辆到达结点时,根据实时信息估算出从当前位置到终点的预计旅行时间,选择下一路段。这样在车辆行驶过程中就能根据提供的实时信息选择更好的路径,达到优化路径的目的。 The problem of vehicle routing is discussed in a dynamic and stochastic traffic network with real-time information. Travel time on each link can be modeled as a random variable and can be estimated with the real-time information before the vehicle enters the link. Different from the classic shortest path algorithms, this algorithm doesn' t need to determine a complete fix path from original node to destination node, only to estimate the travel time from current position to destination node with real-time data and determine the next link when the vehicle arrives at the node. Using real-time information as the routed vehicle advance, it has a chance to divert to a better path, and achieve the aim of optimizing path.
作者 柯健 陈天滋
出处 《计算机工程与设计》 CSCD 北大核心 2005年第10期2662-2664,2667,共4页 Computer Engineering and Design
基金 信息产业部科研项目(2003XK320014)
关键词 最短路径 车辆导航 旅行时间 动态随机网 shortest path vehicle guidance travel time dynamic and stochastic traffic network
  • 相关文献

参考文献10

  • 1Dijkstra E W. A note on two problems in connection with graphs[J].Math, 1959,(1):269-271.
  • 2Ravindra K Ahuja. Faster algorithms for the shortest path problem [J].Journal of the Association for Computing Machinery,1990,37 (2):213-223.
  • 3Stefano Pallottino. A new algorithms for reoptimizing shortest paths when the arc cost change [J].Operations Research Letters,2003,31:149-160
  • 4Frank H.Shortest paths in probability graphs [J]. Operations Research 1969, 17:583-599.
  • 5Hall R. The fastest path through a network with random time-dependent travel time [C]. Transport, 1986.182-188.
  • 6Kaufman D E, Lee J, Smith RL.Fastest paths in time-dependent network for intelligent vehicle highway systems application [J].IVHS J, 1993,(1):1-11.
  • 7Amir Azaron, Farhad Kianfar. Dynamic shortest path in stochastic dynamic network: Ship routing problem [J]. European Journal of Operational Research, 2003,144:138-156.
  • 8Pattanamekar P, Park D.Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty [C].Transportation Research 2003.331-354.
  • 9Shinkoh Okada., Fuzzy shortest path problems incorporating interactivity among paths [J].Fuzzy Sets and Systems, 2004,142:335-357.
  • 10Koutsopoulos H N, Xu H. An information discounting routing strategy for advanced travel information systems [J]. Transport Res, 1993,(3):249-264.

同被引文献25

引证文献1

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部