An outer approximation algorithm for the robust shortest path problem

作者：Shahabi Mehrdad; Unnikrishnan Avinash^*; Boyles Stephen D

来源：Transportation Research Part E: Logistics and Transportation Review , 2013, 58: 52-66.

DOI：10.1016/j.tre.2013.07.002

• Robust shortest path
• Mean - standard deviation objective
• Outer approximation

This paper describes a new algorithm for the stochastic shortest path problem where path costs are a weighted sum of expected cost and cost standard deviation. We allow correlation between link costs, subject to a regularity condition excluding unbounded solutions. The chief complication in this variant is that path costs are not an additive sum of link costs. In this paper, we reformulate this problem as a conic quadratic program, and develop an outer-approximation algorithm based on this formulation. Numerical experiments show that the outer-approximation algorithm significantly outperforms standard integer programming algorithms implemented in solvers.

• 出版日期2013-11