Time-dependent SHARC-routing

DOI10.1007/S00453-009-9341-0MaRDI QIDQ547279zbMATH OpenOpenAlexFDO

Authors Daniel Delling

Publication date 1 July 2011

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-009-9341-0

zbMATH Keywords

graph algorithmstime-dependent shortest pathsalgorithm engineeringtimetable information

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Time-Dependent SHARC-Routing
• Time-dependent route planning
• SHARC: fast and robust unidirectional routing
• Core routing on dynamic time-dependent road networks
• SHARC, fast and robust unidirectional routing

Cites work

• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• scientific article; zbMATH DE number 5734725 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Algorithms – ESA 2005
• An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Efficient models for timetable information in public transportation systems
• Engineering Highway Hierarchies
• Engineering Route Planning Algorithms
• Experimental and Efficient Algorithms
• Experimental and Efficient Algorithms
• Partitioning graphs to speedup Dijkstra's algorithm
• SHARC, fast and robust unidirectional routing
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The shortest route through a network with time-dependent internodal transit times
• Time-Dependent SHARC-Routing
• Time-dependent networks as models to achieve fast exact time-table queries
• Towards realistic modeling of time-table information through the time-dependent approach

Cited in

(16)

• Space-efficient, fast and exact routing in time-dependent road networks
• Energy-optimal routes for battery electric vehicles
• SHARC: fast and robust unidirectional routing
• An axiomatic approach to time-dependent shortest path oracles
• Time-dependent alternative route planning
• Minimum time-dependent travel times with contraction hierarchies
• Bi-directional search for robust routes in time-dependent bi-criteria road networks
• SHARC, fast and robust unidirectional routing
• OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS
• Time-dependent routing
• Time-dependent route planning
• Time-dependent routing problems: a review
• Time-dependent contraction hierarchies
• Core routing on dynamic time-dependent road networks
• Time-Dependent SHARC-Routing
• Bidirectional \(A^*\) search on time-dependent road networks

Describes a project that uses

Uses Software

• DIMACS
• Scotch
• R

This page was built for publication: Time-dependent SHARC-routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547279)