期刊文献+

用于最短路算法的公交网络模型构建 被引量:2

Public Transit Network Modeling for Shortest Path Algorithm
下载PDF
导出
摘要 公共交通线路网络的复杂化使乘客难于选择最优的出行线路。用于最短路算法的公交网络模型,解决了有向图难以承载票价和换乘这两个出行要素的问题,有效地把公交出行要素包含在弧中,使得最短路算法可以直接根据这些要素搜索最优出行方案。 It is difficult for passengers to choose an optimize travel route in a complicate public transit network.A new public transit network model for shortest path algorithm solved the issue that it is difficult to describe travel price and transfer count in a directed graph.The model carried out the key travel factors effectively,therefore the shortest path algorithm could search the optimize solution directly based on them.
出处 《交通标准化》 2011年第8期177-179,共3页 Communications Standardization
关键词 最短路 公交网络 公交换乘 shortest path public transit network public transit transfer
  • 相关文献

参考文献5

  • 1Ting Zhao,Jinyun Fang.A transit path planning model based on the heterogeneous road network[C].Fairfax:17th International Conference on Geoinformatics,2009.
  • 2Douglas B West.Introduction to Graph Theory[M].2nd Edition.New Jersey:Prentice Hall,2000.
  • 3黄栋,曹晓航,沙海,彭建.城市公交换乘模型的优化研究[J].地理信息世界,2009,7(5):45-50. 被引量:1
  • 4郝光,张殿业,冯勋省.多目标最短路径模型及算法[J].西南交通大学学报,2007,42(5):641-646. 被引量:18
  • 5Edward Minieka.Optimization Algorithms for Network and Graphs[M].New York and Basel; Marcel Dekker,Inc.,1978.

二级参考文献23

  • 1赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法[J].计算机应用,2004,24(12):136-137. 被引量:36
  • 2李丹,曲玉萍,王晓燕.城市公交出行系统中的最优路线算法研究[J].中国交通信息产业,2005(5):122-123. 被引量:3
  • 3郝光,牟奇峰,张殿业,郭耀煌.基于格序偏好的模糊多目标决策方法[J].西南交通大学学报,2006,41(4):517-521. 被引量:15
  • 4DIJKSTRA E W.A note on two problems in connection with graphs[J].Numer.Math.,1959,1:269-271.
  • 5CAI X,KLOKS T,WONG C K.Time varying shortest path problems algorithm for problems with constraints[J].Networks,1997,29:141-149.
  • 6IRINA LOACHIM S G.A dynamic programming algorithm for the shortest path problem with time windows and linear node costs[J].Networks,1998,31:193-204.
  • 7BURTON D,Toint L.On an instance of the inverse shortest pairs problem[J].Mathematical Programming,1992,53:45-61.
  • 8YU G,YANG J.On the robust shortest path problem[J].Computer & Ops.Res.,1998,25:457-468.
  • 9PELEGRIM B,FERNQNDEZ P.On the sum-max bi-criterion path problem[J].Computer & Ops.Res.,1998,25:1 043-1 054.
  • 10CURRENT J,MARSH M.Multiobjective transportation network design and routing problems:taxonomy and annotation[J].European Journal of Operational Research,1993,65:1-15.

共引文献17

同被引文献17

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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