Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

DOI10.1007/978-3-540-85097-7_21MaRDI QIDQ5505661zbMATH OpenOpenAlexFDO

Authors Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_21

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Point-to-point shortest paths on dynamic time-dependent road networks
• Space-efficient, fast and exact routing in time-dependent road networks
• Fast paths in large-scale dynamic road networks
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Efficient computation of shortest paths in time-dependent multi-modal networks
• Fast Routing in Road Networks with Transit Nodes

Cites work

• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Engineering Route Planning Algorithms
• Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings.
• Fast paths in large-scale dynamic road networks
• Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
• Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Speed-Up Techniques for Shortest-Path Computations

Cited in

(10)

• Core routing on dynamic time-dependent road networks
• Bidirectional A^* search on time-dependent road networks
• An A* algorithm framework for the point-to-point time-dependent shortest path problem
• Fast Routing in Road Networks with Transit Nodes
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
• The time-dependent quickest path problem: properties and bounds
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Point-to-point shortest paths on dynamic time-dependent road networks

This page was built for publication: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

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