A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution
This article employs a robust optimization approach for the shortest path problem where travel cost is uncertain and exact information on the distribution function is unavailable. We show that under such conditions the robust shortest path problem can be formulated as a binary nonlinear integer program, which can then be reformulated as a mixed integer conic quadratic program. Based on this reformulation, we present an outer approximation algorithm as a solution algorithm which is shown to be highly efficient for this class of programs. Numerical experiments conducted on small to large networks further compare the robust optimization‐based strategy to the classical deterministic shortest path in terms of the uncertainty in the network.
Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution
This article employs a robust optimization approach for the shortest path problem where travel cost is uncertain and exact information on the distribution function is unavailable. We show that under such conditions the robust shortest path problem can be formulated as a binary nonlinear integer program, which can then be reformulated as a mixed integer conic quadratic program. Based on this reformulation, we present an outer approximation algorithm as a solution algorithm which is shown to be highly efficient for this class of programs. Numerical experiments conducted on small to large networks further compare the robust optimization‐based strategy to the classical deterministic shortest path in terms of the uncertainty in the network.
Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution
Shahabi, Mehrdad (author) / Unnikrishnan*, Avinash (author) / Boyles, Stephen D. (author)
Computer‐Aided Civil and Infrastructure Engineering ; 30 ; 433-448
2015-06-01
16 pages
Article (Journal)
Electronic Resource
English
A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction
| Taylor & Francis Verlag | 2004
Shortest Path of Emergency Vehicles Under Uncertain Urban Traffic Conditions
| British Library Online Contents | 1996
Sample-Based Algorithm to Determine Minimum Robust Cost Path with Correlated Link Travel Times
| British Library Online Contents | 2014
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
| British Library Online Contents | 2013
Properties of Expected Travel Cost Function with Uncertain Travel Time
| British Library Online Contents | 2011