城市交通最优路径算法  

Study on an urban transportation optimal path algorithm

作　　者：陈亮[1] 何为[1] 韩力群[1] 

机构地区：[1]北京工商大学计算机与信息工程学院,北京100048

出　　处：《智能系统学报》2012年第2期167-173,共7页CAAI Transactions on Intelligent Systems

摘　　要：城市智能交通系统中,最优路径算法及其优化是研究热点之一,是整个交通系统较为核心的部分.结合图论中最短路径算法,研究了城市交通可达路径算法,并对其进行了有效优化.通过图论中的路径代价函数,提出了城市最优路径算法,在此基础上,通过优化搜索区域、可达路径的搜索方向以及路网分层搜索等优化策略,达到了优化城市最优路径算法的目的,提出的城市最优路径及其优化算法能够给出行者提供多条参考的时间最优路线,方便出行者选择.通过算法的应用实例,验证了城市最优路径及其优化算法的有效性与实时性.In urban intelligent transportation systems, the optimal path algorithm and its optimlzatmn are hot topic and the core of the whole transportation system. By introducing the shortest path algorithm in graph theory, this paper first researched the accessible paths for the urban transportation along with an optimization algorithm. Next, by using the path cost function, an optimal path algorithm for urban transportation was proposed. On this basis, by optimizing the search area, the search direction for accessible paths, and the road network hierarchical search optimi- zation strategy, the goal of optimizing urban paths was attained. The proposed optimal urban path and its optimization algorithm were able to provide several time-optimal pedestrian paths for references. Through practical applications, the validity and real-time characteristics of the proposed urban optimal path and its optimization algorithm were verified.

关 键 词：智能交通 图论 行车路线算法优化 RBF神经网络 最优路径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]