Shortest paths in piecewise continuous time-dependent networks

DOI10.1016/j.orl.2008.07.002zbMath1151.90334OpenAlexW2018887123WikidataQ59222266 ScholiaQ59222266MaRDI QIDQ2517795

Mauro Dell'Amico, Manuel Iori, Daniele Pretolani

Publication date: 9 January 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.07.002

zbMATH Keywords

algorithmsshortest pathtime-dependent travel times

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (3)

Time-dependent routing problems: a review ⋮ A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits ⋮ Optimising waiting at nodes in time-dependent networks: cost functions and applications

Cites Work

• A note on two problems in connexion with graphs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Efficient modeling of travel in networks with time-varying link speeds
• An Appraisal of Some Shortest-Path Algorithms
• Unnamed Item

This page was built for publication: Shortest paths in piecewise continuous time-dependent networks