Robust capacity expansion of network flows

We consider the problem of expanding arc capacities in a network subject to demand and travel time uncertainty. We propose a robust optimization approach to obtain capacity expansion solutions that are insensitive to this uncertainty. Our results show that, under reasonable assumptions for network flow applications, such robust solutions can be computed by solving tractable conic linear problems. For example, the robust solution for a multicommodity flow problem is obtained by solving a linear program if the problem has a single source and sink per commodity and the uncertainty in demand and travel time is given by independent bounded polyhedral sets. Preliminary computational results show that the robust solution is attractive, as it can reduce the worst case cost by more than 20%, while incurring a 5% loss in optimality when compared to the optimal solution of a representative scenario.

[1]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[2]  Scott A. Malcolm,et al.  Robust Optimization for Power Systems Capacity Expansion under Uncertainty , 1994 .

[3]  Vernon Ning Hsu,et al.  Dynamic Capacity Expansion Problem with Deferred Expansion and Age-Dependent Shortage Cost , 2001, Manuf. Serv. Oper. Manag..

[4]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[5]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Supply Chain Management , 2004, IPCO.

[6]  G. Dantzig,et al.  The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand , 1956 .

[7]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

[8]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[9]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[10]  W. T. Huh,et al.  Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand , 2004 .

[11]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[12]  Elana Guslitser UNCERTAINTY- IMMUNIZED SOLUTIONS IN LINEAR PROGRAMMING , 2002 .

[13]  M. Laguna,et al.  Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty , 1998 .

[14]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[15]  Michael C. Ferris,et al.  Robust path choice in networks with failures , 2000, Networks.

[16]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[17]  Donald Goldfarb,et al.  Robust Portfolio Selection Problems , 2003, Math. Oper. Res..

[18]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[19]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[20]  Shabbir Ahmed,et al.  A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty , 2003, J. Glob. Optim..

[21]  L El Ghaoui,et al.  ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES , 1997 .

[22]  Abbas A. Kurawarwala,et al.  A robustness approach to uncapacitated network design problems , 1996 .

[23]  B. Rustem,et al.  Robust capacity planning under uncertainty , 1991 .

[24]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

[25]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..