Bidirectional A ∗ Search for Time-Dependent Fast Paths

DOI10.1007/978-3-540-68552-4_25zbMath1182.90092OpenAlexW1788719447MaRDI QIDQ3506419

Giacomo Nannicini, Dominik Schultes, Leo Liberti, Daniel Delling

Publication date: 13 June 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68552-4_25

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Scalable computational techniques for centrality metrics on temporally detailed social network ⋮ Time-Dependent SHARC-Routing ⋮ On the complexity of time-dependent shortest paths ⋮ Time-dependent SHARC-routing ⋮ Computation of the optimal value function in time-dependent networks ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ Engineering Route Planning Algorithms ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Fast Routing in Road Networks with Transit Nodes
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Speed-Up Techniques for Shortest-Path Computations
• Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
• SHARC: Fast and Robust Unidirectional Routing
• Algorithms – ESA 2005
• An Appraisal of Some Shortest-Path Algorithms
• Geometric containers for efficient shortest-path computation

This page was built for publication: Bidirectional A  ∗  Search for Time-Dependent Fast Paths