| 一种面向城市复杂路网最短路径提取的定向收敛算法* |
| |
| 引用本文： | 刘刚,李永树.一种面向城市复杂路网最短路径提取的定向收敛算法*[J].计算机应用研究,2011,28(6):2082-2084. |
| |
| 作者姓名： | 刘刚 李永树 |
| |
| 作者单位： | 西南交通大学,地理信息工程中心,成都,610031 |
| |
| 基金项目： | 高等学校博士学科点专项科研基金资助项目(20100184110019) |
| |
| 摘 要： | 为提高城市复杂路网最短路径提取的效率，针对路网数据量大、结构密集等特点，研究了路网节点之间最短路径的分布特征，通过引入收敛点方式，设计并实现了一种面向复杂路网最短路径快速提取的定向收敛算法。为检验该算法的有效性，利用某城市道路交通网络进行了实验和分析，并与Dijsktra算法、A*算法等比较，证实了该算法能够提高路径搜索效率，且随着城市路网规模的扩大定向收敛算法的高效性将愈加明显。
|
| 关 键 词： | 城市路网 最短路径 收敛点 定向收敛算法 |
| 收稿时间： | 2010/11/29 0:00:00 |
| 修稿时间： | 5/14/2011 8:45:30 AM |
New algorithm of shortest path extraction based on complex road network |
| |
| LIU Gang,LI Yong-shu.New algorithm of shortest path extraction based on complex road network[J].Application Research of Computers,2011,28(6):2082-2084. |
| |
| Authors: | LIU Gang LI Yong-shu |
| |
| Affiliation: | (Centre of Geography Information Engineering, Southwest Jiaotong University, Chengdu 610031, China) |
| |
| 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... |
| |
| Keywords: | urban road network the shortest path convergent node orientation convergent algorithem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
