On finding minimum routes in a network with turn penalties

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 Algorithm 1 accomplishes this quite nicely, and using that algorithm and a procedure developed by Hoffman and Pavley 2 (programmed by them for the IBM 650) it is even possible to find the “ N th best path.”