.png){kind=icon}
返回
Accelerating the shortest-path calculation using cut nodes for problem reduction and division
.png){kind=icon}
PRE
AI
DOI：10.1080/13658816.2019.1660781.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Algorithms
data processing
Geographical Information Science & Systems
computational methods
data structures
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.1
论文数:
2.7K
被引数:
9.3K
机构
引用论文
Rhinovirus replication and innate immunity in highly differentiated human airway epithelial cells
OAAI
.png){kind=icon}
OAAI分享收藏The modulatory effect of neurotensin on [3H]dopamine release from rat nucleus accumbens slices is enhanced after chronic desipramine treatment神经tensin对大鼠 nucleus accumbens 切片[3H]多巴胺释放的调节作用在慢性 desipramine 处理后增强
PREAI
分享收藏
分享收藏
查看更多内容