Abstract
We investigate the robust shortest path problem using the robust linear optimization methodology as proposed by Ben-Tal and Nemirovski. We discuss two types of uncertainty, namely, box uncertainty and ellipsoidal uncertainty. In case of box uncertainty, the robust counterpart is simple. It is a shortest path problem with the original arc lengths replaced by their upper bounds. When dealing with ellipsoidal uncertainty, we obtain a conic quadratic optimization problem with binary variables. We present an example to show that a subpath of a robust shortest path is not necessarily a robust shortest path.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Ben-Tal and A. Nemirovski. (1999) Robust solutions of uncertain linear programs. Oper. Res. Lett., 25(1)1–13.
A. Ben-Tal and A. Nemirovski. (2001) Lectures on Modern Convex Optimization. Analysis, Algorithms and Engineering Applications. Volume 1 of MPS/SIAM Series on Optimization. SIAM, Philadelphia, USA.
A. Ben-Tal and A. Nemirovski. (2002) Robust optimization—methodology and applications. Math. Program, 92(3, Ser. B): 453–480.
O.E. Karasan, M.C. Pinar, H. Yaman. (2001) The Robust Shortest Path Problem with Interval Data. Optimization Online. http://www.optimization — online.org/DBHTML/2001/08/361.html.
D. Bertsimas, M. Sim. (2003) Robust Discrete Optimization and Network Flows, Math. Program., Ser. B. 98: 49–71.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaerani, D., Roos, C., Aman, A. (2005). The Robust Shortest Path Problem by Means of Robust Linear Optimization. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_42
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)