Minimum time-dependent travel times with contraction hierarchies

DOI10.1145/2444016.2444020zbMath1322.05128OpenAlexW2050634818MaRDI QIDQ5178737

Peter Sanders, Gernot Veit Batz, Robert Geisberger, Christian Vetter

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000139527/142975495

zbMATH Keywords

shortest pathroad networkspeed-up techniqueearliest arrival problemserver-based route planningtravel time profile

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Related Items (11)

Distance oracles for time-dependent networks ⋮ Search-space size in contraction hierarchies ⋮ Unnamed Item ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ Engineering Route Planning Algorithms ⋮ Energy-optimal routes for battery electric vehicles ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles ⋮ An axiomatic approach to time-dependent shortest path oracles

This page was built for publication: Minimum time-dependent travel times with contraction hierarchies