IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v90y2024i4d10.1007_s10898-024-01424-x.html
   My bibliography  Save this article

A reformulation-enumeration MINLP algorithm for gas network design

Author

Listed:
  • Yijiang Li

    (Georgia Institute of Technology)

  • Santanu S. Dey

    (Georgia Institute of Technology)

  • Nikolaos V. Sahinidis

    (Georgia Institute of Technology
    Georgia Institute of Technology)

Abstract

Gas networks are used to transport natural gas, which is an important resource for both residential and industrial customers throughout the world. The gas network design problem is generally modelled as a nonconvex mixed-integer nonlinear integer programming problem (MINLP). The challenges of solving the resulting MINLP arise due to the nonlinearity and nonconvexity. In this paper, we propose a framework to study the “design variant” of the problem in which the variables are the diameter choices of the pipes, the flows, the potentials, and the states of various network components. We utilize a nested loop that includes a two-stage procedure that involves a convex reformulation of the original problem in the inner loop and an efficient enumeration scheme in the outer loop. We conduct experiments on benchmark networks to validate and analyze the performance of our framework.

Suggested Citation

  • Yijiang Li & Santanu S. Dey & Nikolaos V. Sahinidis, 2024. "A reformulation-enumeration MINLP algorithm for gas network design," Journal of Global Optimization, Springer, vol. 90(4), pages 931-963, December.
    • Handle: RePEc:spr:jglopt:v:90:y:2024:i:4:d:10.1007_s10898-024-01424-x
    DOI: 10.1007/s10898-024-01424-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01424-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-024-01424-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:90:y:2024:i:4:d:10.1007_s10898-024-01424-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.