Dynamic shortest path problems with time-varying costs

DOI10.1007/S11590-009-0162-5MaRDI QIDQ845562zbMATH OpenOpenAlexFDO

Authors S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi

Publication date 29 January 2010

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-009-0162-5

zbMATH Keywords

labeling algorithmstime-varying networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Dynamic shortest paths minimizing travel times and costs
• An approach to the shortest path problem with time-varying
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Time-varying shortest path problems with constraints
• Cheapest paths in dynamic networks

Cites work

• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• A finite-time algorithm for shortest path problems with time-varying costs
• An Appraisal of Some Shortest-Path Algorithms
• Continuous-Time Shortest Path Problems and Linear Programming
• Continuous-time shortest path problems with stopping and starting costs
• Dynamic flows in time-varying networks.
• Dynamic shortest paths minimizing travel times and costs
• Minimum weight paths in time-dependent networks
• Negative-cycle detection algorithms
• Network flows. Theory, algorithms, and applications.
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The shortest route through a network with time-dependent internodal transit times
• Time-varying shortest path problems with constraints

Cited in

(18)

• Dynamic minimum cost path problem with curfews
• Efficient modeling of travel in networks with time-varying link speeds
• Continuous-time dynamic shortest path problems with negative transit times
• Algorithms – ESA 2004
• Continuous-time shortest path problems with stopping and starting costs
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• The time-varying shortest path problem with fuzzy transit costs and speedup
• Shortest paths on dynamic graphs
• A dynamic programming solution of a shortest path problem with time constraints on movement and parking
• An approach to the shortest path problem with time-varying
• Dynamic shortest paths minimizing travel times and costs
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• A minmax regret version of the time-dependent shortest path problem
• A finite-time algorithm for shortest path problems with time-varying costs
• Adaptive image interpolation by cardinal splines in piecewise constant tension
• Minimum cost paths over dynamic networks
• On solving continuous-time dynamic network flows

This page was built for publication: Dynamic shortest path problems with time-varying costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845562)