SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS
6 references·0 citing·24 second hop
Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS (2015)Hierarchical time-dependent shortest path…Optimal routing policy problems in stochastic time-dependent networks (2005)Optimal routing policy proble…An Efficient Algorithm for Real-Time Estimation and Prediction of Dynamic OD Tables (2004)An Efficient Algorithm for Re…Heuristic techniques for accelerating hierarchical routing on road networks (2002)Heuristic techniques for acce…Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks (2002)Adaptations of the A* algorit…2001 Urban Mobility Report (2001)2001 Urban Mobility ReportFASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗ (1993)FASTEST PATHS IN TIME-DEPENDE…The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)An adaptive routing algorithm for in-vehicle route guidance systems with real-time information (2001)Shortest paths in stochastic networks with correlated link costs (2005)Decisions with Multiple Objectives: Preferences and Value Tradeoffs. (1994)Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)On Modelling Route Choice Sets in Transportation Networks: A Synthesis (2008)Adaptive route choices in risky traffic networks: A prospect theory approach (2009)Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem (2013)Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications (1993)Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System (2007)Impact of Ambulance Dispatch Policies on Performance of Emergency Medical Services (2011)Reliable Shortest Path Problems in Stochastic Time-Dependent Networks (2013)The most likely trip matrix estimated from traffic counts (1980)Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts (1993)A gradient approximation approach for adjusting temporal origin–destination matrices (2010)Dynamic origin–destination demand flow estimation under congested traffic conditions (2013)Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: Design, demonstration and validation (2015)Entropy in urban and regional modelling (2021)Multi-period equilibrium modeling planning framework for tradable credit schemes (2016)Superstitions, street traffic, and subjective well-being (2016)Can Tolling Help Everyone? Estimating the Aggregate and Distributional Consequences of Congestion Pricing (2020)State Space Reduction for Nonstationary Stochastic Shortest Path Problems With Real-Time Traffic Information (2005)Optimal Route Based on Dynamic Programming for Road Networks (2008)Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming (2010)
this work references cited by second hop

References

  • 2005Optimal routing policy problems in stochastic time-dependent networks241 cited
  • 1993FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗222 cited
  • 2002Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks221 cited
  • 2004An Efficient Algorithm for Real-Time Estimation and Prediction of Dynamic OD Tables163 cited
  • 2002Heuristic techniques for accelerating hierarchical routing on road networks104 cited
  • 20012001 Urban Mobility Report67 cited

Cited by

No citing works inside the corpus for this window.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work