Shortest paths in stochastic networks with correlated link costs

DOI10.1016/J.CAMWA.2004.07.028MaRDI QIDQ2387385zbMATH OpenOpenAlexFDO

Authors R. E. Kalaba, J. E. II Moore, 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

Adaptive feedback controlCorrelated link costsDynamic programmingShortest pathStochastic networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4079184
• Least expected time paths in stochastic, time-varying transportation networks
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• scientific article; zbMATH DE number 4053318
• scientific article; zbMATH DE number 4057261

Cites work

• A note on two problems in connexion with graphs
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• An Appraisal of Some Shortest-Path Algorithms
• scientific article; zbMATH DE number 3225686 (Why is no real title available?)
• Least expected time paths in stochastic, time-varying transportation networks
• On a routing problem
• On an instance of the inverse shortest paths problem
• On the online shortest path problem with limited arc cost dependencies
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Optimal paths in graphs with stochastic or multidimensional weights
• Stochastic shortest path problems with piecewise-linear concave utility functions

Cited in

(22)

• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
• Dynamic journeying under uncertainty
• 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
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• A mean-risk model for the traffic assignment problem with stochastic travel times
• scientific article; zbMATH DE number 1808552 (Why is no real title available?)
• The constrained shortest path problem with stochastic correlated link travel times
• PH-graphs for analyzing shortest path problems with correlated traveling times
• scientific article; zbMATH DE number 4079184 (Why is no real title available?)
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• On the online shortest path problem with limited arc cost dependencies
• Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
• Randomized Shortest-Path Problems: Two Related Models
• Optimal information location for adaptive routing
• Reliable pathfinding problems for a correlated network: a linear programming problem in a hypergraph
• The dynamic shortest path problem with anticipation
• Optimal routing for maximizing the travel time reliability
• Stochastic shortest path with unlimited hops

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

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