当前位置: X-MOL 学术Int. J. Geograph. Inform. Sci. › 论文详情
Accelerating the shortest-path calculation using cut nodes for problem reduction and division
International Journal of Geographical Information Science ( IF 3.733 ) Pub Date : 2019-09-05 , DOI: 10.1080/13658816.2019.1660781
Wei Wei; Weidong Yang; Weibin Yao; Heyang Xu

The shortest-path algorithm is one of the most important algorithms in geographical information systems. Bellman’s principle of optimization (BPO) is implicit in the shortest-path problem; that is, any involved node must be located in the simple paths between source and destination nodes. Unfortunately, BPO has never been explicitly used to exclude irrelevant nodes in existing methods, potentially leading to unnecessary searches among irrelevant nodes. To address this problem, we propose a BPO-based shortest-path acceleration algorithm (BSPA). In BSPA, a high-level graph is built to locate the necessary nodes and is used to partition the graph and divide a given task into independent subtasks. This allows the speed of any existing method to be improved using parallel computing. In a test using random graphs, on average, at most only 1.209% of the nodes need to be involved in the calculation. When compared with existing algorithms in real-world road networks, the BSPA shows faster preprocessing and query times, being respectively 118 and 463 times faster in the best case. In the worst case, they remain slightly faster.
更新日期:2020-01-08

 

全部期刊列表>>
材料学研究精选
Springer Nature Live 产业与创新线上学术论坛
胸腔和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
杨超勇
周一歌
华东师范大学
南京工业大学
清华大学
中科大
唐勇
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
福州大学
南京大学
王杰
左智伟
湖南大学
清华大学
吴杰
赵延川
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug