IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2020i19p5141-d423052.html
   My bibliography  Save this article

Multi-Objective Optimization of Gas Pipeline Networks

Author

Listed:
  • Andrzej J. Osiadacz

    (Department of Building Installations, Hydrotechnics and Environmental Engineering, Warsaw University of Technology, 20, Nowowiejska Street, 00-653 Warsaw, Poland)

  • Niccolo Isoli

    (Fluid Systems Ltd. 43, Opaczewska Street, room 13, 02-201 Warsaw, Poland)

Abstract

The main goal of this paper is to prove that bi-objective optimization of high-pressure gas networks ensures grater system efficiency than scalar optimization. The proposed algorithm searches for a trade-off between minimization of the running costs of compressors and maximization of gas networks capacity (security of gas supply to customers). The bi-criteria algorithm was developed using a gradient projection method to solve the nonlinear constrained optimization problem, and a hierarchical vector optimization method. To prove the correctness of the algorithm, three existing networks have been solved. A comparison between the scalar optimization and bi-criteria optimization results confirmed the advantages of the bi-criteria optimization approach.

Suggested Citation

  • Andrzej J. Osiadacz & Niccolo Isoli, 2020. "Multi-Objective Optimization of Gas Pipeline Networks," Energies, MDPI, vol. 13(19), pages 1-19, October.
    • Handle: RePEc:gam:jeners:v:13:y:2020:i:19:p:5141-:d:423052
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/19/5141/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/13/19/5141/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andrzej Rusin & Katarzyna Stolecka-Antczak & Krzysztof Kapusta & Krzysztof Rogoziński & Krzysztof Rusin, 2021. "Analysis of the Effects of Failure of a Gas Pipeline Caused by a Mechanical Damage," Energies, MDPI, vol. 14(22), pages 1-21, November.
    2. Jiandong Duan & Fan Liu & Yao Yang & Zhuanting Jin, 2021. "Flexible Dispatch for Integrated Power and Gas Systems Considering Power-to-Gas and Demand Response," Energies, MDPI, vol. 14(17), pages 1-26, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Codas, Andrés & Camponogara, Eduardo, 2012. "Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing," European Journal of Operational Research, Elsevier, vol. 217(1), pages 222-231.
    2. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    3. Jon Lee & Daphne Skipper & Emily Speakman & Luze Xu, 2023. "Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 1-35, January.
    4. Jin, Xiaoyu & Liu, Benxi & Liao, Shengli & Cheng, Chuntian & Zhang, Yi & Zhao, Zhipeng & Lu, Jia, 2022. "Wasserstein metric-based two-stage distributionally robust optimization model for optimal daily peak shaving dispatch of cascade hydroplants under renewable energy uncertainties," Energy, Elsevier, vol. 260(C).
    5. Pedro Castro & Ignacio Grossmann, 2014. "Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems," Journal of Global Optimization, Springer, vol. 59(2), pages 277-306, July.
    6. S. Göttlich & A. Potschka & C. Teuber, 2019. "A partial outer convexification approach to control transmission lines," Computational Optimization and Applications, Springer, vol. 72(2), pages 431-456, March.
    7. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    8. Li, Han-Lin & Fang, Shu-Cherng & Huang, Yao-Huei & Nie, Tiantian, 2016. "An enhanced logarithmic method for signomial programming with discrete variables," European Journal of Operational Research, Elsevier, vol. 255(3), pages 922-934.
    9. Andreas Bärmann & Robert Burlacu & Lukas Hager & Thomas Kleinert, 2023. "On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations," Journal of Global Optimization, Springer, vol. 85(4), pages 789-819, April.
    10. Eduardo Rauh Müller & Eduardo Camponogara & Laio Oriel Seman & Eduardo Otte Hülse & Bruno Ferreira Vieira & Luis Kin Miyatake & Alex Furtado Teixeira, 2022. "Short-term steady-state production optimization of offshore oil platforms: wells with dual completion (gas-lift and ESP) and flow assurance," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 152-180, April.
    11. Burer, Samuel & Piccialli, Veronica, 2019. "Three methods for robust grading," European Journal of Operational Research, Elsevier, vol. 272(1), pages 364-371.
    12. Liu, Haoxiang & Szeto, W.Y. & Long, Jiancheng, 2019. "Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 284-307.
    13. Aalami, Soheila & Kattan, Lina, 2022. "Proportionally fair flow markets for transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 24-41.
    14. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2017. "Linear Reformulation of Polynomial Discrete Programming for Fast Computation," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 108-122, February.
    15. Böttger, T. & Grimm, V. & Kleinert, T. & Schmidt, M., 2022. "The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1095-1111.
    16. Moritz Link & Stefan Volkwein, 2023. "Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs," Journal of Global Optimization, Springer, vol. 87(1), pages 97-132, September.
    17. Benjamin Beach & Robert Hildebrand & Joey Huchette, 2022. "Compact mixed-integer programming formulations in quadratic optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 869-912, December.
    18. Andreas Bärmann & Alexander Martin & Oskar Schneider, 2021. "Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling," Transportation Science, INFORMS, vol. 55(3), pages 747-767, May.
    19. Chase Rainwater & Joseph Geunes & H. Edwin Romeijn, 2014. "Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 290-302, May.
    20. Kazda, Kody & Li, Xiang, 2024. "A linear programming approach to difference-of-convex piecewise linear approximation," European Journal of Operational Research, Elsevier, vol. 312(2), pages 493-511.

    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:gam:jeners:v:13:y:2020:i:19:p:5141-:d:423052. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.