Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
From MaRDI portal
Publication:5505661
DOI10.1007/978-3-540-85097-7_21zbMath1168.90592OpenAlexW1527469337MaRDI QIDQ5505661
Philippe Baptiste, Giacomo Nannicini, 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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A note on two problems in connexion with graphs
- Fast paths in large-scale dynamic road networks
- Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings.
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Speed-Up Techniques for Shortest-Path Computations
- Engineering Route Planning Algorithms
- Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- An Appraisal of Some Shortest-Path Algorithms
