On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
Mathematical Programming: Series A and B
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
Transportation Science
Finding the shortest path in stochastic networks
Computers & Mathematics with Applications
Stochastic shortest path with unlimited hops
Information Processing Letters
Wardrop Equilibria with Risk-Averse Users
Transportation Science
Probabilistic path queries in road networks: traffic uncertainty aware path selection
Proceedings of the 13th International Conference on Extending Database Technology
Expert Systems with Applications: An International Journal
Information Collection on a Graph
Operations Research
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
Information Sciences: an International Journal
| Hi-index | 0.09 |
The objective is to minimize expected travel time from any origin to a specific destination in a congestible network with correlated link costs. Each link is assumed to be in one of two possible conditions. Conditional probability density functions for link travel times are assumed known for each condition. Conditions over the traversed links are taken into account for determining the optimal routing strategy for the remaining trip. This problem is treated as a multistage adaptive feedback control process. Each stage is described by the physical state (the location of the current decision point) and the information state (the service level of the previously traversed links). Proof of existence and uniqueness of the solution to the basic dynamic programming equations and a solution procedure are provided.