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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
