A note on least time path computation considering delays and prohibitions for intersection movements
- 1 October 1996
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 30 (5), 359-367
- https://doi.org/10.1016/0191-2615(96)00001-x
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Shortest route algorithm with movement prohibitionsTransportation Research Part B: Methodological, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- Dynamic traffic assignment by individual path minimization and queuingTransportation Research, 1971
- The minimum route problem for networks with turn penalties and prohibitionsTransportation Research, 1969
- On finding minimum routes in a network with turn penaltiesCommunications of the ACM, 1961