Shortest paths in piecewise continuous time-dependent networks

DOI10.1016/J.ORL.2008.07.002MaRDI QIDQ2517795zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Dell'Amico, Manuel Iori, D. 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

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

Recommendations

• Shortest paths in a network with time-dependent flow speeds
• Bicriterion shortest paths in stochastic time-dependent networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Time version of the shortest path problem in a stochastic-flow network
• scientific article; zbMATH DE number 1808552
• Shortest paths in time-dependent FIFO networks
• Minimum weight paths in time-dependent networks
• Efficient computation of shortest paths in time-dependent multi-modal networks
• Bicriterion shortest hyperpaths in random time-dependent networks
• Least possible time paths in stochastic, time-varying networks.

Cites work

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

Cited in

(26)

• Time depending shortest-path problems with applications to railway networks
• A directed hypergraph model for random time dependent shortest paths
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• A finite-time algorithm for shortest path problems with time-varying costs
• Optimising waiting at nodes in time-dependent networks: cost functions and applications
• Shortest paths in a network with time-dependent flow speeds
• Shortest paths in time-dependent FIFO networks
• Algorithms for time-dependent bicriteria shortest path problems
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• Engineering time-dependent many-to-many shortest paths computation
• scientific article; zbMATH DE number 2086247 (Why is no real title available?)
• scientific article; zbMATH DE number 1810501 (Why is no real title available?)
• Time-dependent routing problems: a review
• Two almost easy problems
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Continuous-Time Shortest Path Problems and Linear Programming
• scientific article; zbMATH DE number 1114039 (Why is no real title available?)
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• Distributed shortest-path protocols for time-dependent networks
• Solving time dependent shortest path problems on airway networks using super-optimal wind
• Time-dependent shortest paths with discounted waits
• Theory and Applications of Models of Computation
• Point-to-point shortest paths on dynamic time-dependent road networks
• A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
• Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic

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

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