Shortest paths in stochastic networks with correlated link costs

DOI10.1016/j.camwa.2004.07.028zbMath1138.90492OpenAlexW1976699101MaRDI QIDQ2387385

J. E. II Moore, Robert E. Kalaba, Yueyue Fan

Publication date: 2 September 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.07.028

zbMATH Keywords

Dynamic programmingShortest pathStochastic networksAdaptive feedback controlCorrelated link costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

PH-graphs for analyzing shortest path problems with correlated traveling times ⋮ Optimal routing for maximizing the travel time reliability ⋮ A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ The existence and uniqueness of solution and the convergence of a multi-step iterative algorithm for a system of variational inclusions with \((A, \eta, m)\)-accretive operators ⋮ Finding the shortest path in stochastic networks ⋮ The \(p\)-step iterative algorithm for a system of generalized mixed quasi-variational inclusions with \((H,\eta)\)-monotone operators ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Dynamic journeying under uncertainty ⋮ Stochastic shortest path with unlimited hops ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions
• Optimal paths in graphs with stochastic or multidimensional weights
• On a routing problem
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• On the online shortest path problem with limited arc cost dependencies
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Shortest paths in stochastic networks with correlated link costs