Bidirectional A* search on time-dependent road networks

DOI10.1002/net.20438zbMath1241.90019OpenAlexW2140836772MaRDI QIDQ2892160

Daniel Delling, Leo Liberti, Dominik Schultes, Giacomo Nannicini

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20438

zbMATH Keywords

shortest pathsroad networkstime-dependent networksgoal directed search

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (12)

The time-dependent shortest path and vehicle routing problem ⋮ Distance oracles for time-dependent networks ⋮ Scheduling activities with time-dependent durations and resource consumptions ⋮ On an exact method for the constrained shortest path problem ⋮ Time-dependent routing problems: a review ⋮ Unnamed Item ⋮ Scalable computational techniques for centrality metrics on temporally detailed social network ⋮ Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind ⋮ Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times ⋮ An axiomatic approach to time-dependent shortest path oracles

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Time-dependent SHARC-routing
• Shortest paths in Euclidean graphs
• Fast paths in large-scale dynamic road networks
• The shortest route through a network with time-dependent internodal transit times
• Speeding Up Dynamic Shortest-Path Algorithms
• Fast Routing in Road Networks with Transit Nodes
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Engineering Route Planning Algorithms
• Shortest paths on dynamic graphs
• Time-Dependent Route Planning
• Shortest paths with euclidean distances: An explanatory model
• SHARC
• An Appraisal of Some Shortest-Path Algorithms
• Geometric containers for efficient shortest-path computation

This page was built for publication: Bidirectional A* search on time-dependent road networks