摘要
提出了一种高效可靠的限制搜索区域的最优路径算法.该算法是基于典型城市路网的共同特征,而不是某个特定城市的统计信息提出的,它可以应用在不同的城市路网中.针对从源站点到目的站点不同的欧式距离,算法分别在两类不同大小的椭圆内搜索最短路径.理论计算和实验结果都表明,当源站点和目的站点相距较远时,与椭圆限制搜索区域算法相比,该算法可以降低33%47%的时间复杂度,而不会影响查询结果的准确性.
An efficient and reliable optimal path algorithm within restricted searching area is proposed in this paper.Based on the common characteristics of typical urban road networks rather than the statistical information of a certain special city it can be used in different urban road networks.This algorithm searches for the shortest path in two kinds of different size ellipses for different Euclidean distances between the source station and the destination station.Compared to the ellipse restricted searching area algorithm,theoretical calculation and experimental results both show that this algorithm can reduce the time-complexity by 33%-47%without producing an effect on the reliability of the query results when the source station is far from the destination station.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2011年第6期1158-1164,共7页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(60532030)
教育部新世纪优秀人才支持计划(NCET-08-0333)
山东省自然科学基金(Y2007G10)
关键词
迪杰斯特拉算法
欧式距离
最短路径
限制搜索区域
典型城市路网
Dijkstra algorithm
Euclidean distance
shortest path
restricted searching area
typical urban road networks
