Fast paths in large-scale dynamic road networks

DOI10.1007/s10589-008-9172-yzbMath1187.90074arXiv0704.1068OpenAlexW2105874695MaRDI QIDQ2268926

Philippe Baptiste, Gilles Barbier, Leo Liberti, Giacomo Nannicini, Daniel Krob

Publication date: 15 March 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.1068

zbMATH Keywords

shortest pathsreal-time datadynamic arc costs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (5)

Bidirectional A* search on time-dependent road networks ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks ⋮ Optimization and sustainable development

Uses Software

• SINTEF

Cites Work

• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Speeding Up Dynamic Shortest-Path Algorithms
• Dynamic shortest paths minimizing travel times and costs
• Engineering Highway Hierarchies
• Algorithms – ESA 2005
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Fast paths in large-scale dynamic road networks