期刊文献+

典型高速公路路网的清分路径算法 被引量:1

A Splitting Route Algorithm in Express Way Tolling System
下载PDF
导出
摘要 清分路径信息是高速公路联网收费清分的关键参数,传统清分计算采用预先计算设定最短路径的数据表,但清分计算的效率随着路网规模的扩大和车流量的增长而不断降低,为此,提出并实现了基于图论、结合路网结构优化的快速算法。应用结果表明,日清分耗时降低为原来的1/3,有效提高了清分效率。该算法同样适用于相似路网结构的收费清分系统。 Splitting route information is a key parameter for toll splitting calculation in express way joint tolling system.Conventional splitting method uses predefined shortest path table,which grows as the road system extends and does not work effectively for dense traffic.A splitting route algorithm based on graph theory and optimized model is presented to improve the efficiency of toll splitting.Practice has indicated that the time consumption of daily toll splitting with new algorithm is reduced by two third.
出处 《上海船舶运输科学研究所学报》 2011年第2期168-171,共4页 Journal of Shanghai Ship and Shipping Research Institute
关键词 清分算法 最短路径 DIJKSTRA算法 同源站 splitting algorithm shortest path algorithm Dijkstra algorithm homologous station
  • 相关文献

参考文献1

二级参考文献7

  • 1Aartsen-prof dr.J.van Leeuwen Copromotor,dr.J.H.Verriet."Route planning Algorithm for Carnavigation"[]..2004
  • 2LIANG Dai.Fast shortest path algorithm for road network and implementation[].Carleton University School of Computer Science COMP Honours Project Fall Term.
  • 3Dijkstra E W.A note on two problems in connection with graphs[].Numerical Mathematics.1959
  • 4Bellman R.On a routing problem[].Quarterly of Applied Mathematics.1958
  • 5Dreyfus SE.An appraisal of some shortest-path algorithms[].Operations Research.1969
  • 6Orda A,Rom R.Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length[].The Journal of The American Medical Association.1990
  • 7Kaufman DE,Smith RL.Fastest paths in time dependent networks for intelligent vehicle highway systems application[].Ivhs Journal.1993

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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