Shortest paths in stochastic networks with correlated link costs

DOI10.1016/J.CAMWA.2004.07.028zbMATH Open1138.90492OpenAlexW1976699101MaRDI QIDQ2387385FDOQ2387385

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

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

zbMATH Keywords

Dynamic programmingShortest pathStochastic networksAdaptive feedback controlCorrelated link costs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• 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
• The \(p\)-step iterative algorithm for a system of generalized mixed quasi-variational inclusions with \((H,\eta)\)-monotone operators
• A mean-risk model for the traffic assignment problem with stochastic travel times
• Optimal information location for adaptive routing
• Stochastic shortest path with unlimited hops
• Finding the shortest path in stochastic networks
• Optimal routing for maximizing the travel time reliability
• Dynamic journeying under uncertainty
• Title not available (Why is that?)
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• The constrained shortest path problem with stochastic correlated link travel times
• Randomized Shortest-Path Problems: Two Related Models
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• PH-graphs for analyzing shortest path problems with correlated traveling times
• The dynamic shortest path problem with anticipation
• 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
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
• On the online shortest path problem with limited arc cost dependencies
• Title not available (Why is that?)

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)