A directionally oriented shortest path algorithm

Author(s)
Butas, L.F.
Year
Abstract

An algorithm that finds the shortest time path for any given type of roadway network is explained in detail. The algorithm has the attractive features of requiring a minimum amount of computer storage, as well as being fast, accurate and economically desirable. A FORTRAN program that actually converts the theory into practice is presented in the appendix of the article.

Request publication

4 + 5 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
A 5226 T IRRD 48207
Source

In: Transportation research 2 (1968) no. 3 sept., p. 253/68

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.