Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., New Jersey (1993)
Ahuja R.K., Orlin J.B., Pallottino S., Scutella M.G.: Dynamic Shortest Paths Minimizing Travel Times and Costs. Networks 41, 197–205 (2003)
Cai X., Kloks T., Wong C.K.: Time-varying shortest path problems with constraints. Networks 29, 141–149 (1997)
Chabini L.: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transp. Res. Rec. 1645, 170–175 (1998)
Cooke L., Halsey E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14, 492–498 (1966)
Cherkassky B.V., Goldberg A.V.: Negative-cycle detection algorithms. Math. Program. 85, 277–311 (1999)
Dreyfus S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17, 395–412 (1969)
Kaufman D.E., Smith R.L.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J. 1, 1–11 (1993)
Nasrabadi, E.: Dynamic Flow in Time-varing Networks, Ph.D. thesis, Amirkabir University of Technology & Technische Universität Berlin, Iran & Germany (2009)
Orda A., Rom R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge length. J. Assoc. Comput. Mach. 37, 607–625 (1990)
Orda A., Rom R.: Minimum weight paths in time-dependent networks. Networks 21, 295–320 (1991)
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)
Philpott A.B., Mees A.I.: Continuous-time shortest path problems with stopping and starting costs. Appl. Math. Lett. 5, 63–66 (1992)
Philpott A.B., Mees A.I.: A finite-time algorithm for shortest path problems with time-varying costs. Appl. Math. Lett. 6, 91–94 (1993)
Pilpoitt A.B.: Continuous-time shortest path problems and linear programming. SIAM J. Control Optim. 32, 538–552 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hashemi, S.M., Mokarami, S. & Nasrabadi, E. Dynamic shortest path problems with time-varying costs. Optim Lett 4, 147–156 (2010). https://doi.org/10.1007/s11590-009-0162-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0162-5