Dynamic shortest paths minimizing travel times and costs

DOI10.1002/net.10072zbMath1090.90189OpenAlexW1601277319WikidataQ59592538 ScholiaQ59592538MaRDI QIDQ4419276

Stefano Pallottino, Ravindra K. Ahuja, James B. Orlin, Maria Grazia Scutellà

Publication date: 31 July 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/1798

zbMATH Keywords

shortest path problemdynamic shortest path problemtraffic networktransportation network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem, Dynamic shortest path problems with time-varying costs, Anytime search in dynamic graphs, The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks, 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, Dynamic graph generation for the shortest path problem in time expanded networks, Algorithms for time-dependent bicriteria shortest path problems, Fast paths in large-scale dynamic road networks, Optimising material handling costs in an assembly workshop, A minmax regret version of the time-dependent shortest path problem, Solving the \(k\)-shortest path problem with time windows in a time varying network, Computation of the optimal value function in time-dependent networks, Shortest paths on dynamic graphs, An extension of labeling techniques for finding shortest path trees

Cites Work

• Unnamed Item
• An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• An Appraisal of Some Shortest-Path Algorithms