Time-dependent SHARC-routing

DOI10.1007/s00453-009-9341-0zbMath1216.68201OpenAlexW4234928733MaRDI QIDQ547279

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Bidirectional A* search on time-dependent road networks ⋮ Distance oracles for time-dependent networks ⋮ Time-dependent routing problems: a review ⋮ Unnamed Item ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ Energy-optimal routes for battery electric vehicles ⋮ An axiomatic approach to time-dependent shortest path oracles

Uses Software

• R
• Scotch
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Partitioning graphs to speedup Dijkstra's algorithm
• Efficient models for timetable information in public transportation systems
• Time-Dependent SHARC-Routing
• Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
• Engineering Route Planning Algorithms
• SHARC
• Engineering Highway Hierarchies
• Algorithms – ESA 2005
• Experimental and Efficient Algorithms
• Experimental and Efficient Algorithms

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