Abstract:
In order to discribe the geographical relevance among tourist attractions based on road information, this paper proposes several concepts including road network model, constrained road distance and neighbor road in radius of R. Constrained Spatial Autocorrelation(CSA) and Shortest Road Path(SRP) algorithm are presented to search the shortest road and computer length of the load. Experiments are conducted with the trunk road data from Guizhou province in the form of MapInfo format, and the results show that SRP can find the shortest road path efficiently and quickly.
Key words:
Constrained Spatial Autocorrelation(CSA),
Moran’s index,
constrained road distance,
neighbor road in radius of R,
Shortest Road Path(SRP) algorithm
摘要: 为刻画基于道路的景区空间相关情况,通过定义道路网络模型、道路受限距离、R-半径近邻道路等概念,提出受限的空间自相关指标及优化道路路径算法SRP,用于搜索景区路网中景点的最邻近道路及计算道路长度。利用MapInfo格式的贵州省城市主干道数据进行实验,结果表明,SRP算法能快速找到最优道路路径。
关键词:
受限的空间自相关指标,
Moran’s指数,
受限道路距离,
R-半径近邻道路,
SRP算法
CLC Number:
XIANG Jian-Beng, WANG Yue, HU Jian. Constrained Optimized Path Searching Algorithm Based on Road Network[J]. Computer Engineering, 2011, 37(12): 53-55.
向剑平, 王悦, 胡剑. 基于道路网络的受限优化路径搜索算法[J]. 计算机工程, 2011, 37(12): 53-55.