Design and implementation of parallel time-dependent least time path algorithms for Intelligent Transportation Systems applications
- 1 April 1997
- journal article
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 5 (2) , 95-107
- https://doi.org/10.1016/s0968-090x(97)00004-1
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer ArchitecturesTransportation Science, 1994
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other ProblemsSIAM Journal on Control and Optimization, 1990
- An Improved Distribution Algorithm for Shortest Paths ProblemIEEE Transactions on Computers, 1984
- Shortest‐path methods: Complexity, interrelations and new propositionsNetworks, 1984
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- On a routing problemQuarterly of Applied Mathematics, 1958