Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems

DOI10.1287/IJOC.2021.1084MaRDI QIDQ5086009OpenAlexFDO

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

Publication date 30 June 2022

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

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

zbMATH Keywords

time discretizationtime-dependent travel timesdynamic discretization discoverytime-expanded networksfastest pathsminimum duration paths

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
• Time-dependent shortest path problems with penalties and limits on waiting
• Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
• The time-dependent shortest path and vehicle routing problem

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A time bucket formulation for the traveling salesman problem with time windows
• On a routing problem
• On the complexity of time-dependent shortest paths
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The Continuous-Time Service Network Design Problem
• The shortest route through a network with time-dependent internodal transit times
• Time depending shortest-path problems with applications to railway networks
• Time-dependent shortest paths with discounted waits

Cited in

(3)

• Perspectives on integer programming for time-dependent models
• Rejoinder on: ``Perspectives on integer programming for time-dependent models
• An exact algorithm for the service network design problem with hub capacity constraints

This page was built for publication: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems

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