Time-dependent contraction hierarchies

DOI10.1137/1.9781611972894.10MaRDI QIDQ5233569zbMATH OpenOpenAlexFDO

Authors Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7a383342d8923f977536bb3a98111c44d9744e22

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Traffic problems in operations research (90B20)

Recommendations

• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Minimum time-dependent travel times with contraction hierarchies
• Time-dependent route planning
• Time-Dependent SHARC-Routing
• Time-dependent SHARC-routing

Cited in

(13)

• Tighter constant-factor time hierarchies
• Time dependent multiobjective best path for multimodal urban routing
• Time-dependent route planning with generalized objective functions
• Search-space size in contraction hierarchies
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Time-dependent route planning
• Real-time traffic assignment using engineered customizable contraction hierarchies
• Minimum time-dependent travel times with contraction hierarchies
• Polynomial-time construction of contraction hierarchies for multi-criteria objectives
• Customizable contraction hierarchies
• Search-space size in contraction hierarchies
• Customizable contraction hierarchies with turn costs
• More hierarchy in route planning using edge hierarchies

This page was built for publication: Time-dependent contraction hierarchies

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