Dynamic shortest path problems with time-varying costs
- 323 Downloads
This paper concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time, and parking with a corresponding time-varying cost is allowed at the nodes. The transit times can also take negative values. A general labeling method, as well as several implementations, are presented for finding shortest paths and detecting negative cycles under the assumption that arc traversal costs are piecewise linear and node parking costs are piecewise constant.
KeywordsDynamic shortest paths Time-varying networks Labeling algorithms
Unable to display preview. Download preview PDF.
- 1.Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., New Jersey (1993)Google Scholar
- 8.Kaufman D.E., Smith R.L.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J. 1, 1–11 (1993)Google Scholar
- 9.Nasrabadi, E.: Dynamic Flow in Time-varing Networks, Ph.D. thesis, Amirkabir University of Technology & Technische Universität Berlin, Iran & Germany (2009)Google Scholar
- 12.Pallottino S., Scutella M.G.: Shortest path algorithms in transportation models: Classical and innovative aspects. In: Marcotte, P., Nguyen, S. (eds) Equilibrium and advanced transportation modelling, pp. 245–281. Kluwer, Norwell (1998)Google Scholar