计算机应用研究2011，Vol.28Issue(6)：2082-2084,3.DOI:10.3969/j.issn.1001-3695.2011.06.022
一种面向城市复杂路网最短路径提取的定向收敛算法
New algorithm of shortest path extraction based on complex road network
摘要
Abstract
For the purpose of enhancing the efficiency of the shortest path extraction based complex urban road network, considering the characteristics of large data and complex layout in urban road network, this paper studied the distribution of the shortest path between nodes, and proposed orientation convergent algorithm towards the rapid extraction of the shortest path in urban road network concerning the convergent node.The experiments validates the algorithm through a city' s traffic networks.In comparison with the existing algorithm, i.e.Dijkstra algorithm, the A* algorithm and so on, this method proves to be more effective.The testing results that the high efficiency of orientation convergent algorithm is more obvious with the expansion of the scale of urban road network.关键词
城市路网/最短路径/收敛点/定向收敛算法Key words
urban road network/ the shortest path/ convergent node/ orientation convergent algorithm分类
天文与地球科学引用本文复制引用
刘刚,李永树..一种面向城市复杂路网最短路径提取的定向收敛算法[J].计算机应用研究,2011,28(6):2082-2084,3.基金项目
高等学校博士学科点专项科研基金资助项目(20100184110019) （20100184110019）
