A Method for the Solution of the Nth Best Path Problem
Journal of the ACM (JACM)
Modeling Costs of Turns in Route Planning
Geoinformatica
Computational data modeling for network-constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Integrated data management for mobile services in the real world
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
CARGuide: on-board computer for automobile route guidance
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Versioning of Network Models in a Multiuser Environment
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Information on the consequence of a move and its use for route improvisation support
COSIT'11 Proceedings of the 10th international conference on Spatial information theory
Traffic actuated car navigation systems in mobile communication networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
High performance multimodal networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Shortest path search from a physical perspective
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 48.22 |
In some highway engineering work it is necessary to find a route between two points in a city's street and freeway network such that a function of time and distance is minimized. Such a route is called a “best” route, and finding such a route is not a difficult task. The Moore Algorithm1 accomplishes this quite nicely, and using that algorithm and a procedure developed by Hoffman and Pavley2 (programmed by them for the IBM 650) it is even possible to find the “Nth best path.”