首页 | 本学科首页   官方微博 | 高级检索  
     

考虑复杂交通规则的最优路径算法在GIS中的实现
引用本文:田晟,许伦辉,王倩雨. 考虑复杂交通规则的最优路径算法在GIS中的实现[J]. 交通与计算机, 2009, 27(4): 136-140
作者姓名:田晟  许伦辉  王倩雨
作者单位:华南理工大学土木与交通学院,广州,510640
摘    要:传统的最优路径算法大多是基于网络图加权计算得到的,较少考虑道路网络的实际交通状况。对传统的Dijkstra算法进行改进使之适用于城市交通诱导系统,在综合考虑复杂交通规划的情况下,实现了1种改进的最优路径算法。算法在极少增加网络节点的情况下,满足城市复杂交通规则,并通过排除不符合交通规则的节点,提高其运行效率。基于Visual Basic和Super Map软件,开发了广州市交通诱导系统,通过实际算例验证算法的有效性与准确性。

关 键 词:Dijkstra  交通规则  最优路径  GIS

Realization of the Optimal Path Algorithm in GIS Based on Complex Traffic Regulation
TIAN Sheng,XU Lunhui,WANG Qianyu. Realization of the Optimal Path Algorithm in GIS Based on Complex Traffic Regulation[J]. Computer and Communications, 2009, 27(4): 136-140
Authors:TIAN Sheng  XU Lunhui  WANG Qianyu
Affiliation:School of Civil Engineering and Transportation;South China University of Technology;Guangzhou 510640;China
Abstract:The traditional optimal path algorithm is obtained based on network map from weighted calculation fact of road network with little consideration of the traffic conditions.Traditional Dijkstra algorithm was improved for urban traffic guidance system.An improved optimal path algorithm was realized by considering the complex traffic plan,which is able to meet the demand of complex traffic regulations with only a very few more nodes.Calculation efficiency of the Dijkstra algorithm was improved by eliminating no...
Keywords:Dijkstra  GIS
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号