On the discovery and generation of certain heuristics
Readings from the AI magazine
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Buckets, Heaps, Lists, and Monotone Priority Queues
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
| Hi-index | 0.00 |
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.