Dynamic shortest paths minimizing travel times and costs
- 7 May 2003
- Vol. 41 (4), 197-205
- https://doi.org/10.1002/net.10072
Abstract
No abstract availableKeywords
Funding Information
- NSF (DMI-9900087, DMI-9820998)
- Office of Naval Research (N00014-98-1-0317)
- INDAM-GNAMPA
- MIUR-SORSA
This publication has 12 references indexed in Scilit:
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic LightsTransportation Science, 2002
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delaysEuropean Journal of Operational Research, 2000
- Shortest Path Algorithms In Transportation Models: Classical and Innovative AspectsPublished by Springer Nature ,1998
- Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run TimeTransportation Research Record: Journal of the Transportation Research Board, 1998
- A note on least time path computation considering delays and prohibitions for intersection movementsTransportation Research Part B: Methodological, 1996
- FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗I V H S Journal, 1993
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The minimum route problem for networks with turn penalties and prohibitionsTransportation Research, 1969