期刊文献+

Dijkstra算法的改进及其在车辆导航系统中的应用

在线阅读 下载PDF
导出
摘要 本文分别阐述传统Dijkstra算法和改进Dijkstra算法的算法思想,并在仿真实验中比较这两个算法在实际应用中的效果,用具体数据证明改进Dijkstra算法能更好的解决当前交通拥堵问题。
作者 郭春桦
出处 《无线互联科技》 2014年第1期235-236,共2页 Wireless Internet Technology
  • 相关文献

参考文献4

二级参考文献55

  • 1Steven I-Jy Chien, Chandra Mouly Kuchipudi. Dynamictravel time prediction with real-time and historic data [ J ].Journal of Transportation Engineering, 2003,129(6) :608-616.
  • 2Yang H. Sensitivity analysis for the elastic-demand networkequilibrium problem with applications [ J ]. TransportationResearch Part B : Methodological, 1997,31 (1) :55-70.
  • 3Hughes P K, Cole B L. What attracts attention when driv-ing? [J]. Ergonomics, 1986,29(3):377-391.
  • 4Dial R, Glover F, Kamey D, et al. A computational analy-sis of alternative algorithms and labeling techniques forfinding shortest path trees [ J ]. Networks, 1979,9(3):215-248.
  • 5Koenig S, Likhachev M. Improved fast replanning for robotnavigation in unknown terrain [ C ] // Proceedings of IEEEInternational Conference on Robotics and Automation,2002. 2002,l:968-975.
  • 6Dantzig G B, Ramser J H. The truck dispatch problem[M]. Management Science, 1959, 6(1): 80-91.
  • 7Psaraftis H N. Dynamic vehicle routing problems[M]// Golden B L, Assad A A. Vehicle Routing: Methods and Studies, North-Holland, 1988:223-248.
  • 8Bertsimas D, Van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane[J]. Operations Research, 1991, 39(4): 601-615.
  • 9Bertsimas D, Van Ryzin G. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles[J]. Operations Research, 1993, 41(1): 60-76.
  • 10Powell W B, Jaillet P, Odoni A R. Stochastic and dynamic networks and routing[M]//Ball M O, Magnanti T L, Monma C L, et al. Handbooks in Operations Research and Management Science, 8: Network Routing, Elsevier Science, Amsterdam, 1995: 141-295.

共引文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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