Minimum weight paths in time-dependent networks

DOI10.1002/net.3230210304zbMath0742.90082OpenAlexW2065006817MaRDI QIDQ3971577

Raphael Rom, Ariel Orda

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210304

zbMATH Keywords

dynamic location problemtime-dependent networkslink delaysloopless path problemminimal delay problemminimum weight path problemnode parking costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (30)

Time dependent multiobjective best path for multimodal urban routing ⋮ Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ The fastest itinerary in time-dependent decentralized travel information systems ⋮ On continuous network flows ⋮ Dynamic shortest path problems with time-varying costs ⋮ Minimum cost paths over dynamic networks ⋮ Path Problems in Complex Networks ⋮ Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach ⋮ On computing Pareto optimal paths in weighted time-dependent networks ⋮ A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Shortest paths in time-dependent FIFO networks ⋮ Distributed shortest-path protocols for time-dependent networks ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Continuous-time shortest path problems with stopping and starting costs ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Efficient modeling of travel in networks with time-varying link speeds ⋮ Dynamic shortest paths minimizing travel times and costs ⋮ Ranking paths in stochastic time-dependent networks ⋮ Unnamed Item ⋮ Shortest paths in piecewise continuous time-dependent networks ⋮ How to find good night train connections ⋮ A finite-time algorithm for shortest path problems with time-varying costs ⋮ Computation of the optimal value function in time-dependent networks ⋮ Energy-optimal routes for battery electric vehicles ⋮ A directed hypergraph model for random time dependent shortest paths ⋮ Queueing networks of random link topology: stationary dynamics of maximal throughput schedules ⋮ NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times ⋮ Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem

Cites Work

• Determination of shortest path in a network with time-dependent edge-lengths¹

This page was built for publication: Minimum weight paths in time-dependent networks