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

DOI10.1287/IJOC.2020.0985zbMATH Open1492.90027OpenAlexW3093293420MaRDI QIDQ5085472FDOQ5085472

Edward He, G. L. Nemhauser, Natashia Boland, Martin W. P. Savelsbergh

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

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

Cites Work

• 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
• On the complexity of time-dependent shortest paths
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Vehicle dispatching with time-dependent travel times
• Time depending shortest-path problems with applications to railway networks
• Time‐dependent shortest paths with discounted waits
• Travel Time Estimation in the Age of Big Data
• The exact path length problem.

Cited In (5)

• A minmax regret version of the time-dependent shortest path problem
• Delay-constrained shortest paths: approximation algorithms and second-order cone models
• The multi-period \(p\)-center problem with time-dependent travel times
• Title not available (Why is that?)
• Shortest path with acceleration constraints: complexity and approximation algorithms

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

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