Abstract
In many applications, the network design problem (NDP) faces significant uncertainty in transportation costs and demand, as it can be difficult to estimate current (and future values) of these quantities. In this paper, we present a robust optimization-based formulation for the NDP under transportation cost and demand uncertainty. We show that solving an approximation to this robust formulation of the NDP can be done efficiently for a network with single origin and destination per commodity and general uncertainty in transportation costs and demand that are independent of each other. For a network with path constraints, we propose an efficient column generation procedure to solve the linear programming relaxation. We also present computational results that show that the approximate robust solution found provides significant savings in the worst case while incurring only minor sub-optimality for specific instances of the uncertainty.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atamtürk A (2003). Strong formulations of robust mixed 0–1 programming. Technical Report BCOL.03.04, IEOR, University of California at Berkeley.
Atamtürk A and Zhang M (2004). Two-stage robust network flow and design under demand uncertainty. Technical Report BCOL.04.03, IEOR, University of California at Berkeley.
Averbakh I and Berman O (2000). Algorithms for the robust 1-center problem on a tree. Eur J Opl Res 123: 292–302.
Balakrishnan A, Magnanti T and Wong R (1995). A decomposition algorithm for local access telecommunications network expansion planning. Opns Res 43: 58–76.
Barahona F, Bermon S, Günlük O and Hood S (2004). Robust capacity planning in semiconductor manufacturing. Research Report RC22196, IBM. http://www.optimization-online.org/DB_HTML/2001/10/379.html.
Ben-Tal A and Nemirovski A (1997). Robust truss topology design via semidefinite programming. SIAM J Optim 7: 991–1016.
Ben-Tal A and Nemirovski A (1998). Robust convex optimization. Math Opns Res 23: 769–805.
Ben-Tal A, Golany B, Nemirovski A and Vital J-P (2005). Supplier–retailer flexible commitments contracts: A robust optimization approach. M&SOM 7: 248–273.
Ben-Tal A, Goryashko A, Guslitzer E and Nemirovski A (2004). Adjustable robust solutions of uncertain linear programs. Math Program 99: 351–376.
Bertsimas D and Sim M (2003). Robust discrete optimization and network flows. Math Program 98: 49–71.
Bertsimas D and Thiele A (2003). A robust optimization approach to supply chain management. Technical Report, MIT, LIDS.
Birge JR and Louveaux F (1997). Introduction to Stochastic Programming. Springer Verlag: New York.
El-Ghaoui L and Lebret H (1997). Robust solutions to least-square problems with uncertain data. SIAM J Matrix Anal Appl 18: 1035–1064.
El-Ghaoui L, Oks M and Oustry F (2003). Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Opns Res 51: 543–556.
El-Ghaoui L, Oustry F and Lebret H (1998). Robust solutions to uncertain semidefinite programs. SIAM J Optim 9: 33–52.
Eppen G, Martin R and Schrage L (1989). A scenario approach to capacity planning. Opns Res 37: 517–527.
Goldfarb D and Iyengar G (2003). Robust portfolio selection problems. Math Opns Res 28: 1–38.
Guslitser E (2002). Uncertainty-immunized solutions in linear programming. Master's thesis, Minerva Optimization Center, Technion. http://iew3.technion.ac.il/Labs/Opt/opt/Pap/Thesis_Elana.pdf.
Hsu VN (2002). Dynamic capacity expansion problem with deferred expansion and age-dependent shortage cost. M&SOM 4: 44–54.
Kouvelis P and Yu G (1997). Robust Discrete Optimization and its Applications. Kluwer Academic Publishers: Norwell, MA.
Laguna M (1998). Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Mngt Sci 44: S101–S110.
Magnanti T and Wong R (1984). Network design and transportation planning: Models and algorithms. Transport Sci 18: 1–55.
Malcolm S and Zenios S (1994). Robust optimization for power systems capacity expansion under uncertainty. J Opl Res Soc 45: 1040–1049.
Minoux M (1989). Network synthesis and optimum network design problems: Models, solution methods, and applications. Networks 19: 313–360.
Mulvey JM, Vanderbei RJ and Zenios SA (1995). Robust optimization of largescale systems. Opns Res 43: 264–281.
Murphy F and Weiss H (1990). An approach to modeling electric utility capacity expansion planning. Naval Res Logist 37: 827–845.
Ordóñez F and Zhao J (2004). Robust capacity expansion of network flows. Technical Report, University of Southern California.
Riis M and Andersen KA (2004). Multiperiod capacity expansion of a telecommunications connection with uncertain demand. Comput Opns Res 31: 1427–1436.
Yaman H, Karaşan O and Pinar M (2001). The robust spanning tree problem with interval data. Opns Res Lett 29: 31–40.
Zhang F, Roundy R, Çakanyildrim M and Huh WT (2004). Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand. IIE Trans 36: 23–36.
Acknowledgements
This research was partially supported by a METRANS grant #0306.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mudchanatongsuk, S., Ordóñez, F. & Liu, J. Robust solutions for network design under transportation cost and demand uncertainty. J Oper Res Soc 59, 652–662 (2008). https://doi.org/10.1057/palgrave.jors.2602362
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602362