计算机工程与应用2012,Vol.48Issue(34):237-240,4.DOI:10.3778/j.issn.1002-8331.1108-0472
一种新的城市交通路径搜索算法
Algorithm searching urban path route
摘要
Abstract
In view of the actual situation of the urban traffic in China, a new algorithm searching traffic route based on adjacency matrix is given. This algorithm, which employs the characteristics of adjacency matrix and its multiplication principle, searches traffic routes of traffic in the n order An -matrix, and combined the Weights of Network Nodes on the road it then obtains a best traffic route. With the simulation experiments and the analysis on the algorithm, it is concluded that this algorithm is characterized by simplicity in design and practicability for application with higher efficiency.关键词
邻接矩阵/城市交通道路/最佳路径搜索算法Key words
adjacency matrix/ urban path/ algorithm searching the best path route分类
信息技术与安全科学引用本文复制引用
阮群生,林宏康..一种新的城市交通路径搜索算法[J].计算机工程与应用,2012,48(34):237-240,4.基金项目
福建省自然科学基金项目(No.2009J01294,No.2011J01357) (No.2009J01294,No.2011J01357)
宁德师范学院服务海西项目(No.2010H2020,No.2010H313). (No.2010H2020,No.2010H313)