Robust Shortest Path Problem With Distributional Uncertainty
TLDR
A concept of robust mean-excess travel time is introduced to hedge against the risk from both the uncertainty of the random travel times and the uncertainty in their distributions and the impact of uncertainty on the relative benefit and cost of robust paths is demonstrated.Abstract:
Routing service considering uncertainty is at the core of intelligent transportation systems and has attracted increasing attention. Existing stochastic shortest path models require the exact probability distributions of travel times and usually assume that they are independent. However, the distributions are often unavailable or inaccurate due to insufficient data, and correlation of travel times over different links has been observed. This paper presents a robust shortest path (RSP) model that only requires partial distribution information of travel times, including the support set, mean, variance, and correlation matrix. We introduce a concept of robust mean-excess travel time to hedge against the risk from both the uncertainty of the random travel times and the uncertainty in their distributions. To solve the RSP problem, an equivalent dual formulation is derived and used to design tight lower and upper bound approximation methods, which adopt the scenario approach and semi-definite programming approach, respectively. To solve large problems, we further propose an efficient primal approximation method, which only needs to solve two deterministic shortest path problems and a mean-standard deviation shortest path problem, and analyze its approximation performance. Experiments validate the tightness of the proposed bounds and demonstrate the impact of uncertainty on the relative benefit and cost of robust paths.read more
Citations
More filters
Journal ArticleDOI
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
TL;DR: A new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutron set and comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method.
Journal ArticleDOI
A distributionally robust optimization for blood supply network considering disasters
TL;DR: A two-stage distributionally robust optimization (DRO) model is proposed, in which uncertain distributions of blood demand are described by a moment-based ambiguous set, to optimize blood inventory prepositioning and relief activities together.
Journal ArticleDOI
Economic dispatch of a single micro-gas turbine under CHP operation
TL;DR: An accurate optimization model is developed for solving the economic dispatch problem of integrating the turbine into the grid, and the financial benefit and viability of this approach is examined on four detailed scenarios using real data on energy demand profiles and electricity tariffs.
Journal ArticleDOI
Lagrangian relaxation for the reliable shortest path problem with correlated link travel times
TL;DR: A novel LR approach based on a new convex problem reformulation, and new methods to update Lagrangian multipliers and handle negative cycles of the resulting shortest path problems are proposed.
References
More filters
Journal ArticleDOI
Optimization of conditional value-at-risk
R. T. Rockafellar,S Uryasev +1 more
TL;DR: In this paper, a new approach to optimize or hedging a portfolio of financial instruments to reduce risk is presented and tested on applications, which focuses on minimizing Conditional Value-at-Risk (CVaR) rather than minimizing Value at Risk (VaR), but portfolios with low CVaR necessarily have low VaR as well.
Book
Robust Discrete Optimization and Its Applications
TL;DR: This paper presents four approaches to handle Uncertainty in Decision Making using a Robust Discrete Optimization Framework and results show how these approaches can be applied to real-world problems.
Journal ArticleDOI
The scenario approach to robust control design
TL;DR: A rich family of control problems which are in general hard to solve in a deterministically robust sense is therefore amenable to polynomial-time solution, if robustness is intended in the proposed risk-adjusted sense.
Journal ArticleDOI
Some NP-complete problems in quadratic and nonlinear programming
Katta G. Murty,Santosh N. Kabadi +1 more
TL;DR: A special class of indefinite quadratic programs is constructed, with simple constraints and integer data, and it is shown that checking (a) or (b) on this class is NP-complete.
Journal ArticleDOI
Distributionally Robust Convex Optimization
TL;DR: A unifying framework for modeling and solving distributionally robust optimization problems and introduces standardized ambiguity sets that contain all distributions with prescribed conic representable confidence sets and with mean values residing on an affine manifold.
Related Papers (5)
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
Erick Delage,Yinyu Ye +1 more