摘要
针对我国城市交通道路实际情况,提出一种新的基于邻接矩阵的交通路径搜索算法,算法利用邻接矩阵的特点及其相乘原理,在n阶An-矩阵中找出交通中的"途径线路",结合道路上网络节点的相关权值,计算得出一条最佳交通路径。通过算法分析和仿真实验,结果表明,算法运行效率高,设计简单,实用性强。
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 A^n -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.
出处
《计算机工程与应用》
CSCD
2012年第34期237-240,共4页
Computer Engineering and Applications
基金
福建省自然科学基金项目(No.2009J01294
No.2011J01357)
宁德师范学院服务海西项目(No.2010H2020
No.2010H313)
关键词
邻接矩阵
城市交通道路
最佳路径搜索算法
adjacency matrix
urban path
algorithm searching the best path route
