Finding shortest paths on real road networks: the case for A

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is...

Full description

Saved in:
Bibliographic Details
Published in:International journal of geographical information science : IJGIS 2009-04, Vol.23 (4), p.531-543
Main Authors: Zeng, W., Church, R. L.
Format: Article
Language:English
Subjects:
A algorithm
Efficiency
Geographic information science
Optimization algorithms
Roads & highways
Routing
Shortest path algorithms
Transportation networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficient implementations of the Dijkstra algorithm are the fastest at optimally solving the 'one-to-one' shortest path problem (Cherkassky et al. 1996 ). We show that the most efficient state-of-the-art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS-sourced data. The results of this paper, derived from tests of different algorithmic approaches on real road networks, will be extremely valuable for application developers and researchers in the GIS community.
ISSN:1365-8816
1365-8824
1362-3087
DOI:10.1080/13658810801949850