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

DOI10.4230/LIPIcs.ESA.2020.81OpenAlexW3080468723MaRDI QIDQ5874554

Dorothea Wagner, Ben Strasser, 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)

Related Items (2)

Multistage graph problems on a global budget ⋮ NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Search-space size in contraction hierarchies
• Time-dependent SHARC-routing
• Core Routing on Dynamic Time-Dependent Road Networks
• Bidirectional A* search on time-dependent road networks
• Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies
• Minimum time-dependent travel times with contraction hierarchies
• Engineering Oracles for Time-Dependent Road Networks
• Customizable Contraction Hierarchies
• Engineering multilevel overlay graphs for shortest-path queries
• SHARC
• An Appraisal of Some Shortest-Path Algorithms
• Nested Dissection of a Regular Finite Element Mesh

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