Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty

Abstract A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.

[1]  Asgeir Tomasgard,et al.  Decomposition strategy for the stochastic pooling problem , 2012, J. Glob. Optim..

[2]  P. I. Barton,et al.  Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs , 2004, Math. Program..

[3]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[4]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[5]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[6]  Ignacio E. Grossmann,et al.  A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves , 2004, Comput. Chem. Eng..

[7]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..

[8]  Michael R. Bussieck,et al.  General Algebraic Modeling System (GAMS) , 2004 .

[9]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[10]  Xiang Li,et al.  Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs , 2011, J. Optim. Theory Appl..

[11]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[12]  Tore Wiig Jonsbråten,et al.  Optimization models for petroleum field exploitation , 1998 .

[13]  Paul I. Barton,et al.  Nonconvex Generalized Benders Decomposition with Piecewise Convex Relaxations for Global Optimization of Integrated Process Design and Operation Problems , 2012 .

[14]  C. Adjiman,et al.  Global optimization of mixed‐integer nonlinear problems , 2000 .

[15]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[16]  Asgeir Tomasgard,et al.  Long-term planning of natural gas production systems via a stochastic pooling problem , 2010, Proceedings of the 2010 American Control Conference.

[17]  I. Grossmann,et al.  A Multistage Stochastic Programming Approach for the Planning of Offshore Oil or Gas Field Infrastructure Under Decision Dependent Uncertainty , 2008 .

[18]  Thomas A. Adams,et al.  Decomposition strategy for the global optimization of flexible energy polygeneration systems , 2012 .

[19]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[20]  P. I. Barton,et al.  Stochastic pooling problem for natural gas production network design and operation under uncertainty , 2011 .

[21]  Ajay Selot,et al.  Short-term supply chain management in upstream natural gas systems , 2009 .

[22]  Michael C. Ferris,et al.  Grid-Enabled Optimization with GAMS , 2009, INFORMS J. Comput..

[23]  Ignacio E. Grossmann,et al.  A novel branch and bound algorithm for optimal development of gas fields under uncertainty in reserves , 2006, Comput. Chem. Eng..

[24]  P. I. Barton,et al.  Construction of Convex Relaxations Using Automated Code Generation Techniques , 2002 .