Core Routing on Dynamic Time-Dependent Road Networks

DOI10.1287/ijoc.1110.0448zbMath1460.90054OpenAlexW2091492284MaRDI QIDQ2815439

Giacomo Nannicini, Daniel Delling

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0448

zbMATH Keywords

shortest pathsroute planningtime-dependent networksdynamic road networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (3)

The impact of time aggregation and travel time models on time-dependent routing solutions ⋮ Determining time-dependent minimum cost paths under several objectives ⋮ Space-efficient, fast and exact routing in time-dependent road networks

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Time-dependent SHARC-routing
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Engineering Route Planning Algorithms
• SHARC
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• Algorithms – ESA 2005
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Core Routing on Dynamic Time-Dependent Road Networks