Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting

DOI10.1287/ijoc.2020.0985zbMath1492.90027OpenAlexW3093293420MaRDI QIDQ5085472

Edward He, Nemhauser, George I., Natashia Boland, Savelsbergh, Martin W. P.

Publication date: 27 June 2022

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

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

zbMATH Keywords

computational complexityshortest pathtime-dependent travel timetime-expanded network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (1)

Shortest path with acceleration constraints: complexity and approximation algorithms

Cites Work

• On the complexity of time-dependent shortest paths
• Time depending shortest-path problems with applications to railway networks
• Vehicle dispatching with time-dependent travel times
• The shortest route through a network with time-dependent internodal transit times
• The Exact Path Length Problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Travel Time Estimation in the Age of Big Data
• Time‐dependent shortest paths with discounted waits

This page was built for publication: Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting