检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京工商大学计算机与信息工程学院,北京100048
出 处:《智能系统学报》2011年第5期424-431,共8页CAAI Transactions on Intelligent Systems
摘 要:行车路线优化是城市智能交通系统的研究热点之一,对整个交通系统的优化起着重要作用.分析了影响行车时间的各种因素,结合图论中最短路径算法,建立了基于RBF神经网络的路径代价函数模型.基于该函数模型,可以计算出交通图中任意给定两地间的时间最优路径.将该模型应用于实际路况进行有效性验证,得到了有实用价值的结果,说明了该模型的正确性和有效性.Vehicle route optimization is one of the hot topics in research on urban intelligent transportation systems ( ITS), and it plays an important role in the optimization of the entire transportation system. This paper analyzed various lactors that attect the travel time and established a path cost tunctlon model with an radial basis lunctlon neural network, based on the shortest paths algorithms in graph theory. By this function model, the time-orientedoptimal path between any two given places on a traffic map can be calculated. The model was applied to actual traffic to validate the effectiveness, and its results are of practical value, showing the correctness and validity of themodel.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195