An algorithm operating on a new and compact representation of link exit times to solve the one-to-all fastest path problem in dynamic networks is presented. The new space-efficient representation that exploits the first-in, first-out property of link travel times in dynamic networks is developed. The algorithm is described, and its working on a simple network is presented. The algorithm directly operates on bit streams of data representing time-dependent link travel times and performs logical operations on 0 and 1 bits only. Computational results are presented for large dynamic networks. The ideas behind the development of this algorithm are extendable to the development of algorithms operating at the bit level to solve other variants of dynamic shortest path problems and other dynamic network flow problems. These developments then open new research possibilities in the development of solution algorithms for dynamic network problems.
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 1771 , 1 ; 201-208
2001-01-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Online Contents | 2001
|Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
British Library Conference Proceedings | 2001
|FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION
Taylor & Francis Verlag | 1993
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION
Taylor & Francis Verlag | 1993
|Construction of Fastest Curvature-Constrained Paths in Direction-Dependent Media
Online Contents | 2014
|