Abstract
We consider a formulation for the fixed charge network flow (FCNF) problem subject to multiple uncertain arc failures, which aims to provide a robust optimal flow assignment in the sense of restricting potential losses using Conditional Value-at-Risk (CVaR). We show that a heuristic algorithm referred to as Adaptive Dynamic Cost Updating Procedure (ADCUP) previously developed for the deterministic FCNF problem can be extended to the considered problem under uncertainty and produce high-quality heuristic solutions for large problem instances. The reported computational experiments demonstrate that the described procedure can successfully tackle both the uncertainty considerations and the large size of the networks. High-quality heuristic solutions for problem instances with up to approximately 200,000 arcs have been identified in a reasonable time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert R, Albert I, Nakarado G (2004) Structural vulnerability of the North American power grid. Phys Rev E 69:025103
Atamturk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper Res 55:662–673
Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large-scale uncapacitated network design. Oper Res 37:716–740
Barr R, Glover F, Klingman D (1981) A new optimization method for large scale fixed charge transportation problems. Oper Res 29:448–463
Boginski V, Commander C, Turko T (2009) Polynomial-time identification of robust network flows under uncertain arc failures. Optim Lett 3:461–473
Cabot A, Erenguc S (1984) Some branch-and-bound procedures for fixed-cost transportation problems. Nav Res Logist Q 31:145–154
Commander C, Pardalos PM, Ryabchenko V, Uryasev S (2006) The wireless network jamming problem. J Comb Optim 14:481–498
Cooper L, Drebes C (1967) An approximate solution method for the fixed charge problem. Nav Res Logist Q 8:101–113
Costa AM (2005) A survey on benders decomposition applied to fixed-charge network. Comput Oper Res 32:1429–1450
Cruz FRB, Smith JM, Mateus GR (1998) Solving to optimality the uncapacitated fixed-charge network flow problem. Comput Oper Res 25:67–81
Denzler D (1969) An approximate algorithm for the fixed charge problem. Nav Res Logist Q 16:411–416
Geunes J, Pardalos PM (2003) Network optimization in supply chain management and financial engineering: an annotated bibliography. Networks 42:66–84
Geunes J, Pardalos PM (2005) Supply chain optimization. Springer, Berlin
Gray P (1971) Exact solution for the fixed-charge transportation problem. Oper Res 19:1529–1538
Gupta A, Ravi R, Sinha A (2004) An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science, pp 218–227
Hewitt M, Nemhauser GL, Savelsbergh WP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J Comput 22:314–325
Hirsch WM, Dantzig GM (1968) The fixed charge problem. Nav Res Logist Q 15:413–424
Kennington JL, Unger V (1976) A new branch-and-bound algorithm for the fixed charge transportation problem. Manag Sci 22:1116–1126
Kennington JL, Nicholson CD (2010) The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment. INFORMS J Comput 22:326–337
Kim D, Pardalos PM (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper Res Lett 24:195–203
Krokhmal PA (2007) Higher moment coherent risk measures. Quant Finance 7:1469–7688
Krokhmal P, Palmquist J, Uryasev S (2002) Portfolio optimization with conditional value-at-risk objective and constraints. J Risk 4:11–27
Murty KG (1968) Solving the fixed charge problem by ranking the extreme points. Oper Res 16:268–279
Nahapetyan A, Pardalos PM (2007) A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J Ind Manag Optim 3:71–85
Nahapetyan A, Pardalos PM (2008) Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput Optim Appl 39:37–50
Nemhauser G, Wolsey GL (1999) Integer and combinatorial optimization. In: Series in discrete mathematics and optimization. Wiley-Interscience, New York
Ortega F, Wolsey L (2003) A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem. Networks 41:143–158
Powell W (1986) Stochastic model of the dynamic vehicle allocation problem. Transp Sci 20:117–129
Rockafellar RT, Uryasev S (2002) Conditional value-at-risk for general loss distributions. J Bank Finance 26:1443–1471
Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 3:21–41
Steinberg DI (1970) The fixed charge problem. Nav Res Logist Q 17:217–235
Tsamasphyrou P, Renaud A, Carpentier P (2000) Transmission network planning under uncertainty with Benders decomposition. In: Lecture notes in economics and mathematical systems, pp 457–468
Ukkusuri S, Mathew T, Waller T (2007) Robust transportation network design under demand uncertainty. Comput-Aided Civ Infrastruct Eng 22:6–18
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by the Department of Energy Office of Science and the Defense Threat Reduction Agency.
Rights and permissions
About this article
Cite this article
Sorokin, A., Boginski, V., Nahapetyan, A. et al. Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J Comb Optim 25, 99–122 (2013). https://doi.org/10.1007/s10878-011-9422-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9422-2