On finding minimum routes in a network with turn penalties
- 1 February 1961
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 4 (2) , 107-108
- https://doi.org/10.1145/366105.366184
Abstract
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.”Keywords
This publication has 1 reference indexed in Scilit:
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959