Benders decomposition approach for the robust network design problem with flow bifurcations. Issue 1 (20th September 2012)

• Record Type: Journal Article
• Authors: Lee, Chungmok; Lee, Kyungsik; Park, Sungsoo
• Is Part Of: Networks. Volume 62:Issue 1(2013:Aug.)
• Page Start: 1
• Page End: 16
• Publication Date: 2012-09-20
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21486
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>We consider a network design problem in which flow bifurcations are allowed. The demand data are assumed to be uncertain, and the uncertainties of demands are expressed by an uncertainty set. The goal is to install facilities on the edges at minimum cost. The solution should be able to deliver any of the demand requirements defined in the uncertainty set. We propose an exact solution algorithm based on a decomposition approach in which the problem is decomposed into two distinct problems: <xref ref-type="link" rid="eqn1">(1)</xref> designing edge capacities; and <xref ref-type="link" rid="eqn2">(2)</xref> checking the feasibility of the designed edge capacities with respect to the uncertain demand requirements. The algorithm is a special case of the Benders decomposition method. We show that the robust version of the Benders subproblem can be formulated as a linear program whose size is polynomially bounded. We also propose a simultaneous cut generation scheme to accelerate convergence of the Benders decomposition algorithm. Computational results on real‐life telecommunication problems are reported, and these demonstrate that robust solutions with very small penalties in the objective values can be obtained. © 2012 Wiley Periodicals, Inc. Networks, 2013.</p> </abstract>