In:
Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 1771, No. 1 ( 2001-01), p. 201-208
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
0361-1981
,
2169-4052
Language:
English
Publisher:
SAGE Publications
Publication Date:
2001
detail.hit.zdb_id:
2403378-9
