Finding traffic-aware fastest paths in spatial networks

DOI10.1007/978-3-642-40235-7_8MaRDI QIDQ2847563zbMATH OpenOpenAlexFDO

Authors Shuo Shang, Torben Bach Pedersen, Xike Xie, Hua Lu

Publication date 10 September 2013

Published in Advances in Spatial and Temporal Databases (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40235-7_8

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• Fast paths in large-scale dynamic road networks
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• The time-dependent quickest path problem: properties and bounds
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Time-dependent route planning

This page was built for publication: Finding traffic-aware fastest paths in spatial networks

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