The shortest route through a network with time-dependent internodal transit times
From MaRDI portal
Publication:2532356
Cites work
Cited in
(51)- Continuous-time shortest path problems with stopping and starting costs
- Travelling time on dense networks
- The implicit general order complementarity problem, models and iterative methods
- Periodicity and critical circuits in a generalized max-algebra setting
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- Determining time-dependent minimum cost paths under several objectives
- Vehicle dispatching with time-dependent travel times
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Shortest paths in a network with time-dependent flow speeds
- An axiomatic approach to time-dependent shortest path oracles
- On the fast delivery problem with one or two packages
- Dynamic journeying under uncertainty
- Fast paths in large-scale dynamic road networks
- Shortest paths in time-dependent FIFO networks
- Dynamic programming and minimum risk paths
- Algorithms for time-dependent bicriteria shortest path problems
- Multicriteria adaptive paths in stochastic, time-varying networks
- 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
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- On computing Pareto optimal paths in weighted time-dependent networks
- Core routing on dynamic time-dependent road networks
- Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation
- Bidirectional A^* search on time-dependent road networks
- How to find good night train connections
- Efficient computation of time-dependent centralities in air transportation networks
- A simulated annealing for multi-criteria network path problems
- Data-driven approaches for emissions-minimized paths in urban areas
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Time-Dependent SHARC-Routing
- Engineering Route Planning Algorithms
- Shortest paths on dynamic graphs
- Shortest route with time dependent length of edges and limited delay possibilities in nodes
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- 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
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Time-dependent SHARC-routing
- The time-dependent shortest path and vehicle routing problem
- 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
- Snapshot centrality indices in dynamic FIFO networks
- Labeling methods for partially ordered paths
- Beyond fifty years of vehicle routing: insights into the history and the future
- A minmax regret version of the time-dependent shortest path problem
- Dynamic shortest path problems with time-varying costs
- Routing of a hazmat truck in the presence of weather systems
- A survey of dynamic network flows
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
This page was built for publication: The shortest route through a network with time-dependent internodal transit times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532356)
