Time-varying shortest path problems with constraints

DOI10.1002/(SICI)1097-0037(199705)29:3%3C141::AID-NET2%3E3.0.CO;2-HMaRDI QIDQ4347281zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constraintshortest path problemtransit timestraverse timewaiting times

Mathematics Subject Classification ID

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

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

Cited in

(33)

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

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)