Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks

DOI10.1007/978-3-540-92182-0_71MaRDI QIDQ3597882zbMATH OpenOpenAlexFDO

Authors Daniel Delling, Giacomo Nannicini

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_71

Mathematics Subject Classification ID

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

Recommendations

• Core routing on dynamic time-dependent road networks
• Bidirectional \(A^*\) search on time-dependent road networks
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Time-dependent route planning
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

Cited in

(9)

• Engineering Route Planning Algorithms
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Bi-directional search for robust routes in time-dependent bi-criteria road networks
• Time-dependent SHARC-routing
• Efficient computation of shortest paths in time-dependent multi-modal networks
• Scalable computational techniques for centrality metrics on temporally detailed social network
• Core routing on dynamic time-dependent road networks
• Bidirectional \(A^*\) search on time-dependent road networks
• User-constrained multimodal route planning

This page was built for publication: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks

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