Convex relaxations for gas expansion planning

doi:10.1287/ijoc.2016.0697

Title: Convex relaxations for gas expansion planning

Abstract

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutions to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution

Authors:

Borraz-Sanchez, Conrado ^[1]; Bent, Russell Whitford ^[1]; Backhaus, Scott N. ^[1]; Hijazi, Hassan ^[2]; Van Hentenryck, Pascal ^[2]

Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
NICTA and ANU, Canberra (Australia)

Publication Date:: 2016-01-01

Research Org.:: Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1296664

Report Number(s):: LA-UR-15-24636
Journal ID: ISSN 1091-9856

Grant/Contract Number:: AC52-06NA25396

Resource Type:: Accepted Manuscript

Journal Name:: INFORMS Journal on Computing

Additional Journal Information:: Journal Volume: 28; Journal Issue: 4; Journal ID: ISSN 1091-9856

Publisher:: INFORMS

Country of Publication:: United States

Language:: English

Subject:: 03 NATURAL GAS; Natural gas network; Expansion planning problem; MINLP problem; convex relaxations; Lower bound

Citation Formats


                    Borraz-Sanchez, Conrado, Bent, Russell Whitford, Backhaus, Scott N., Hijazi, Hassan, and Van Hentenryck, Pascal. Convex relaxations for gas expansion planning.  United States: N. p., 2016. 
        Web.  doi:10.1287/ijoc.2016.0697.

Copy to clipboard


                    Borraz-Sanchez, Conrado, Bent, Russell Whitford, Backhaus, Scott N., Hijazi, Hassan, & Van Hentenryck, Pascal. Convex relaxations for gas expansion planning.  United States.  doi:10.1287/ijoc.2016.0697.

Copy to clipboard


                    Borraz-Sanchez, Conrado, Bent, Russell Whitford, Backhaus, Scott N., Hijazi, Hassan, and Van Hentenryck, Pascal. Fri .  
        "Convex relaxations for gas expansion planning".  United States.  doi:10.1287/ijoc.2016.0697.  https://www.osti.gov/servlets/purl/1296664.

Copy to clipboard


                    
@article{osti_1296664,

  title        = {Convex relaxations for gas expansion planning},

  author       = {Borraz-Sanchez, Conrado and Bent, Russell Whitford and Backhaus, Scott N. and Hijazi, Hassan and Van Hentenryck, Pascal},

  abstractNote = {Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutions to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution},

  doi          = {10.1287/ijoc.2016.0697},

  journal      = {INFORMS Journal on Computing},

  number       = 4,

  volume       = 28,

  place        = {United States},

  year         = {2016},

  month        = {1}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

DOI: 10.1287/ijoc.2016.0697

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Works referencing / citing this record:

GasLib—A Library of Gas Network Instances
journal, December 2017

Schmidt, Martin; Aßmann, Denis; Burlacu, Robert
Data, Vol. 2, Issue 4
DOI: 10.3390/data2040040

Similar Records in DOE PAGES and OSTI.GOV collections:

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

Journal Article Wei, Wei ; Wang, Jianhui ; Li, Na ; ... - IEEE Transactions on Smart Grid

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, tomore »« less
DOI: 10.1109/tsg.2017.2684183
Multicriteria approximation through decomposition

Conference Burch, C ; Krumke, S ; Marathe, M ; ...

The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of their technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. Their method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximationmore »« less
Full Text Available
Multicriteria approximation through decomposition

Conference Burch, C ; Sandia National Labs., Albuquerque, NM ; Krumke, S ; ...

The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of the technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. The method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximationmore »« less
Full Text Available
Polyhedral approximation in mixed-integer convex optimization

Journal Article Lubin, Miles ; Yamangil, Emre ; Bent, Russell Whitford ; ... - Mathematical Programming

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order tomore »« less
Cited by 8
DOI: 10.1007/s10107-017-1191-y

Full Text Available
SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

Journal Article Ungun, B ; Stanford University School of Medicine, Stanford, CA ; Fu, A ; ... - Medical Physics

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction,more »« less
DOI: 10.1118/1.4956525

Similar Records

Title: Convex relaxations for gas expansion planning

Abstract

Citation Formats

GasLib—A Library of Gas Network Instances journal, December 2017

GasLib—A Library of Gas Network Instances
journal, December 2017