A Shortest Path Searching Method with Area Limitation Heuristics
While heuristics based on geometric constructs of the networks would appear to improve performance of Dijkstra’s algorithm, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited area heuristics guided by spatial arrangement of networks. The algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable.
KeywordsShort Path Destination Node Short Path Problem Geographic Information System Short Path Algorithm
- Miller, H.J., Shaw, S.L.: Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press, New York (2001)Google Scholar
- Car, A., Frank, A.: General principles of hierarchical spatial reasoning-the case of wayfinding. In: Proceedings of the 6th International Symposium on Spatial Data Handling, pp. 646–664 (1994)Google Scholar