In:
ISPRS International Journal of Geo-Information, MDPI AG, Vol. 11, No. 10 ( 2022-10-09), p. 514-
Abstract:
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd–Warshall, cannot be extended to large-scale road networks, or the traversal speed on large-scale networks is very slow, which is computational and memory intensive. Therefore, researchers have developed many approximate methods, such as the landmark method and the embedding method, to speed up the processing time of graphs and the shortest path query. This study proposes a new method based on landmarks and embedding technology, and it proposes a multilayer neural network model to solve this problem. On the one hand, we generate distance-preserving embedding for each node, and on the other hand, we predict the shortest path distance between two nodes of a given embedment. Our approach significantly reduces training time costs and is able to approximate the real distance with a relatively low Mean Absolute Error (MAE). The experimental results on a real road network confirm these advantages.
Type of Medium:
Online Resource
ISSN:
2220-9964
DOI:
10.3390/ijgi11100514
Language:
English
Publisher:
MDPI AG
Publication Date:
2022
detail.hit.zdb_id:
2655790-3
Permalink
