The shortest route through a network with time-dependent internodal transit times
From MaRDI portal
Publication:2532356
DOI10.1016/0022-247X(66)90009-6zbMath0173.47601OpenAlexW1986652726MaRDI QIDQ2532356
Publication date: 1966
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(66)90009-6
Related Items (50)
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ Periodicity and critical circuits in a generalized max-algebra setting ⋮ The time-dependent shortest path and vehicle routing problem ⋮ Bidirectional A* search on time-dependent road networks ⋮ Distance oracles for time-dependent networks ⋮ Dynamic shortest path problems with time-varying costs ⋮ A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set ⋮ Routing of a hazmat truck in the presence of weather systems ⋮ A simulated annealing for multi-criteria network path problems ⋮ Data-driven approaches for emissions-minimized paths in urban areas ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ On computing Pareto optimal paths in weighted time-dependent networks ⋮ Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting ⋮ Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems ⋮ The impact of time aggregation and travel time models on time-dependent routing solutions ⋮ A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits ⋮ A fishing route optimization decision support system: the case of the tuna purse seiner ⋮ Bidirectional A ∗ Search for Time-Dependent Fast Paths ⋮ Shortest paths in time-dependent FIFO networks ⋮ Dynamic programming and minimum risk paths ⋮ Optimising waiting at nodes in time-dependent networks: cost functions and applications ⋮ On the fast delivery problem with one or two packages ⋮ A survey of dynamic network flows ⋮ Determining time-dependent minimum cost paths under several objectives ⋮ Time-Dependent SHARC-Routing ⋮ Shortest paths in a network with time-dependent flow speeds ⋮ Snapshot centrality indices in dynamic FIFO networks ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ Continuous-time shortest path problems with stopping and starting costs ⋮ Dynamic journeying under uncertainty ⋮ Time-dependent SHARC-routing ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Fast paths in large-scale dynamic road networks ⋮ Shortest route with time dependent length of edges and limited delay possibilities in nodes ⋮ Travelling time on dense networks ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge ⋮ Solving the \(k\)-shortest path problem with time windows in a time varying network ⋮ How to find good night train connections ⋮ Efficient Computation of Time-Dependent Centralities in Air Transportation Networks ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation ⋮ Engineering Route Planning Algorithms ⋮ Shortest paths on dynamic graphs ⋮ The implicit general order complementarity problem, models and iterative methods ⋮ Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem ⋮ Vehicle dispatching with time-dependent travel times ⋮ An axiomatic approach to time-dependent shortest path oracles
Cites Work
This page was built for publication: The shortest route through a network with time-dependent internodal transit times
