期刊文献+

基于Dijkstra算法优化的城市交通路径分析 被引量:51

Analysis of urban traffic vehicle routing based on Dijkstra algorithm optimization
下载PDF
导出
摘要 为降低运输、时间和距离成本,需合理地规划城市车辆行驶线路.以汉中市主城区道路网络为例,考虑选线过程中道路风险阻强和路况因素,利用网络拓扑、地理编码和网络分析,基于Dijkstra算法优化对车辆行驶路线进行选择,并对最优路线进行分析与验证.结果表明:GIS网络分析与Dijkstra算法的有效集成不但可实现城市车辆行驶路线优化决策,而且Dijkstra算法优化能减少节点访问次数和时间复杂度.在行驶时间和距离约束条件下,限速、道路等级、路况信息是制约选线的主要因素,其图形化结果可以为驾驶员的驾车出行、交通管理部门决策提供技术支持和参考. In order to reduce the transportation cost,time duration and distance cost,the route network of urban vehicles was reasonably planned.The paper employed the road network of the main urban area of Hanzhong City as an example,considering the risk resistance and road condition factors in the road planning,which the road selection and optimization under various constraints were jointly built on the basis of Dijkstra algorithm.The analysis and realization were verified with the geocoding,network topology and GIS network analysis tools.The results show that the integration of GIS network analysis technology and Dijkstra algorithm not only realize the optimization decision of urban vehicle route,but also the improved Dijkstra algorithm reduces the number of node visiting and time complexity.Under the driving time and distance constraints,the speed limit,road hierarchy and road condition are the restrictive factors of the line selection.The graphical description could provide a technical support and reference for the driver’s driving strip and traffic management department decision-making.
作者 吴红波 王英杰 杨肖肖 WU Hongbo;WANG Yingjie;YANG Xiaoxiao(Department of Geographical Science,Shaanxi University of Technology,Hanzhong Shaanxi 723000,China;Shanxi Key of Laboratory of Earth Surface System and Environmental Carrying Capacity,Northwest University,Xi’an 710127,China;School of Civil Engineering,Beijing Jiaotong University,Beijing 100044,China)
出处 《北京交通大学学报》 CAS CSCD 北大核心 2019年第4期116-121,130,共7页 JOURNAL OF BEIJING JIAOTONG UNIVERSITY
基金 国家自然科学基金(41601067) 中国博士后科学基金(2017M611011)~~
关键词 城市交通 地理信息系统 DIJKSTRA算法 约束条件 路径分析 urban traffic geographic information system Dijkstra gorithm constraint conditions path analysis
  • 相关文献

参考文献2

二级参考文献19

  • 1姚亚锋,方贤进,陈代梅.Dijkstra算法的一种高效率实现[J].计算机与数字工程,2007,35(7):21-22. 被引量:7
  • 2郝伟,刘万青.基于GIS的救护车辆最短路径算法[J].计算机应用,2008,28(S2):103-104. 被引量:4
  • 3夏松,韩用顺.GIS中最短路径算法的改进实现[J].测绘通报,2004(9):40-42. 被引量:22
  • 4李宁,王晓宇.石化企业重大泄漏事故建模及GIS图形模拟的研究[J].东华理工学院学报,2005,28(3):274-277. 被引量:4
  • 5严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,2007.
  • 6XIAO Y Y, ZHAO Q H, KAKU I. Development of a fuel consumption optimization model for the eapacitated vehicle routing problem [ J ]. Computers & Operations Research, 2012,39(7): 1419- 1431.
  • 7WANG Z C, LI J, FAN J, et al. Research on improved hybrid particle swarm optimization for vehicle routing prob- lem with time windows [ C]//International Conference on Artificial Intelligence and Computational Intelligence, Sanya, China, 2010:179-183.
  • 8Balseiro S R, Loiseau I, Ramonet J. An ant colony algo- rithm hybridized with insertion heuristics for the time de- pendent vehicle routing problem with time windows [J ]. Computers & Operations Research, 2011,38 (6): 954 - 966.
  • 9Bafios R, Ortega J, Gil C, et al. A hybrid meta-heuristic for multiple-objective vehicle routing problems with time windows[J ]. Computers & Industrial Engineering, 2013, 65(2) :286 - 296.
  • 10Peng Y, Peng J, Li H. Multi-trip vehicle routing problem based on fuel consumption reduction [ C ]// International Conference of Logistics Engineering and Management, Chengdu, China, 2010: 2640 - 2646.

共引文献17

同被引文献404

引证文献51

二级引证文献183

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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