Space-efficient, fast and exact routing in time-dependent road networks

DOI10.4230/LIPICS.ESA.2020.81OpenAlexW3080468723MaRDI QIDQ5874554FDOQ5874554

Authors: Ben Strasser, Dorothea Wagner, Tim Zeitz 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1910.12726

zbMATH Keywords

shortest pathsrealistic road networkstime-dependent route planning

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A note on two problems in connexion with graphs
• Nested Dissection of a Regular Finite Element Mesh
• An Appraisal of Some Shortest-Path Algorithms
• Bidirectional \(A^*\) search on time-dependent road networks
• Minimum time-dependent travel times with contraction hierarchies
• Time-dependent SHARC-routing
• Search-space size in contraction hierarchies
• Computing the shortest path: \(A^\ast\) search meets graph theory
• SHARC, fast and robust unidirectional routing
• Engineering multilevel overlay graphs for shortest-path queries
• Real-time traffic assignment using engineered customizable contraction hierarchies
• Core routing on dynamic time-dependent road networks
• Engineering oracles for time-dependent road networks
• Customizable contraction hierarchies

Cited In (4)

• Multistage graph problems on a global budget
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• Fast Routing in Road Networks with Transit Nodes
• NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times

This page was built for publication: Space-efficient, fast and exact routing in time-dependent road networks

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