Time-varying shortest path problems with constraints

DOI10.1002/(SICI)1097-0037(199705)29:3%3C141::AID-NET2%3E3.0.CO;2-HzbMATH Open0876.05060OpenAlexW1987916269MaRDI QIDQ4347281FDOQ4347281

Authors:

Publication date: 7 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199705)29:3%3C141::aid-net2%3E3.0.co;2-h

Recommendations

• scientific article; zbMATH DE number 1114039
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• scientific article; zbMATH DE number 6913891
• Time-varying minimum cost flow problems

zbMATH Keywords

constraintshortest path problemwaiting timestransit timestraverse time

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Discrete location and assignment (90B80)

Cited In (31)

• Computation of the optimal value function in time-dependent networks
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
• Continuous-time shortest path problems with stopping and starting costs
• Routing of a hazmat truck in the presence of weather systems
• Variants of shortest path problems
• Dynamic journeying under uncertainty
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• Approximation solutions for time-varying shortest path problem
• On the complexity of time-dependent shortest paths
• Shortest path problems with left-side time windows
• Flows over time in time-varying networks: optimality conditions and strong duality
• The time-varying shortest path problem with fuzzy transit costs and speedup
• A dynamic programming solution of a shortest path problem with time constraints on movement and parking
• On the complexity of time-dependent shortest paths
• Time-dependent shortest paths with discounted waits
• Time-dependent shortest path problems with penalties and limits on waiting
• A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
• Dynamic shortest path problems with time-varying costs
• The approach‐dependent, time‐dependent, label‐constrained shortest path problem
• Path Problems in Complex Networks
• Title not available (Why is that?)
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Minimum time paths in a network with mixed time constraints.
• Time-varying minimum cost flow problems
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
• Time-varying shortest path problem with curfews
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Optimising waiting at nodes in time-dependent networks: cost functions and applications

This page was built for publication: Time-varying shortest path problems with constraints

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