IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38189-8_14.html
   My bibliography  Save this book chapter

A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization

In: Facets of Combinatorial Optimization

Author

Listed:
  • Björn Geißler

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Department Mathematik)

  • Antonio Morsi

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Department Mathematik)

  • Lars Schewe

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Department Mathematik)

Abstract

In this article, we present a new algorithm for the solution of nonconvex mixed-integer nonlinear optimization problems together with an application from gas network optimization, the gas transport energy cost minimization problem. Here, the aim is to transport gas through the network at minimum operating cost. The proposed algorithm is based on the adaptive refinement of a new class of MIP-relaxations and has been developed within an industry project on gas network optimization. Since therefore the implementation is not as general as it could be, our computational results are restricted to instances from gas network optimization at this point of time. However, as these problems are real-world applications and turn out to be rather hard to solve with the aid of state-of-the-art MINLP-solvers we believe that our computational results reveal the potential of this new approach and motivate further research on the presented techniques.

Suggested Citation

  • Björn Geißler & Antonio Morsi & Lars Schewe, 2013. "A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization," Springer Books, in: Michael Jünger & Gerhard Reinelt (ed.), Facets of Combinatorial Optimization, edition 127, pages 321-353, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38189-8_14
    DOI: 10.1007/978-3-642-38189-8_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-642-38189-8_14. 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.