IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v30y2018i2p309-323.html

Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods

Author

Listed:
  • Björn Geißler

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Discrete Optimization, 91058 Erlangen, Germany)

  • Antonio Morsi

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Discrete Optimization, 91058 Erlangen, Germany)

  • Lars Schewe

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Discrete Optimization, 91058 Erlangen, Germany)

  • Martin Schmidt

    (Friedrich-Alexander-Universität Erlangen-Nürnberg, Discrete Optimization, 91058 Erlangen, Germany; Energie Campus Nürnberg, 90429 Nürnberg, Germany)

Abstract

Detailed modeling of gas transport problems leads to nonlinear and nonconvex mixed-integer optimization or feasibility models (MINLPs) because both the incorporation of discrete controls of the network and accurate physical and technical modeling are required to achieve practical solutions. Hence, ignoring certain parts of the physics model is not valid for practice. In the present contribution we extend an approach based on linear relaxations of the underlying nonlinearities by tailored model reformulation techniques yielding block-separable MINLPs. This combination of techniques allows us to apply a penalty alternating direction method and thus to solve highly detailed MINLPs for large-scale, real-world instances. The practical strength of the proposed method is demonstrated by a computational study in which we apply the method to instances from steady-state gas transport including both pooling effects with respect to the mixing of gases of different composition and a highly detailed compressor station model.

Suggested Citation

  • Björn Geißler & Antonio Morsi & Lars Schewe & Martin Schmidt, 2018. "Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 309-323, May.
    • Handle: RePEc:inm:orijoc:v:30:y:2018:i:2:p:309-323
    DOI: 10.1287/ijoc.2017.0780
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2017.0780
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2017.0780?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
    ---><---

    References listed on IDEAS

    as
    1. Richard E. Wendell & Arthur P. Hurter, 1976. "Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints," Operations Research, INFORMS, vol. 24(4), pages 643-657, August.
    2. Daniel Rose & Martin Schmidt & Marc C. Steinbach & Bernhard M. Willert, 2016. "Computational optimization of gas compressor stations: MINLP models versus continuous reformulations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(3), pages 409-444, June.
    3. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.
    4. Björn Geißler & Oliver Kolb & Jens Lang & Günter Leugering & Alexander Martin & Antonio Morsi, 2011. "Mixed integer linear models for the optimization of dynamical transport networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(3), pages 339-362, June.
    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. Lars Schewe & Martin Schmidt & Johannes Thürauf, 2020. "Structural properties of feasible bookings in the European entry–exit gas market system," 4OR, Springer, vol. 18(2), pages 197-218, June.
    2. Benjamin Hiller & René Saitenmacher & Tom Walther, 2021. "Improved models for operation modes of complex compressor stations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(2), pages 171-195, October.
    3. 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.
    4. Diego Cattaruzza & Martine Labbé & Matteo Petris & Marius Roland & Martin Schmidt, 2024. "Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems," INFORMS Journal on Computing, INFORMS, vol. 36(4), pages 1084-1107, July.
    5. Zhou, Jun & Qin, Can & Fu, Tiantian & Liu, Shitao & Liang, Guangchuan & Li, Cuicui & Hong, Bingyuan, 2024. "Automatic response framework for large complex natural gas pipeline operation optimization based on data-mechanism hybrid-driven," Energy, Elsevier, vol. 307(C).
    6. Falk M. Hante & Martin Schmidt, 2019. "Complementarity-based nonlinear programming techniques for optimal mixing in gas networks," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 299-323, September.
    7. Jan Pablo Burgard & Carina Moreira Costa & Martin Schmidt, 2024. "Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate," Annals of Operations Research, Springer, vol. 339(3), pages 1525-1568, August.
    8. Lars Schewe & Martin Schmidt & Johannes Thürauf, 2020. "Computing technical capacities in the European entry-exit gas market is NP-hard," Annals of Operations Research, Springer, vol. 295(1), pages 337-362, December.
    9. Katrin Halbig & Lukas Hümbs & Florian Rösel & Lars Schewe & Dieter Weninger, 2024. "Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1579-1610, December.
    10. Wen, Kai & Qiao, Dan & Nie, Chaofei & Lu, Yangfan & Wen, Feng & Zhang, Jing & Miao, Qing & Gong, Jing & Li, Cuicui & Hong, Bingyuan, 2023. "Multi-period supply and demand balance of large-scale and complex natural gas pipeline network: Economy and environment," Energy, Elsevier, vol. 264(C).
    11. Carina Moreira Costa & Dennis Kreber & Martin Schmidt, 2022. "An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2968-2988, November.
    12. Thomas Kleinert & Martin Schmidt, 2021. "Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 198-215, January.
    13. Johannes Thürauf, 2022. "Deciding the feasibility of a booking in the European gas market is coNP-hard," Annals of Operations Research, Springer, vol. 318(1), pages 591-618, November.
    14. Wang, Guotao & Zhao, Wei & Qiu, Rui & Liao, Qi & Lin, Zhenjia & Wang, Chang & Zhang, Haoran, 2023. "Operational optimization of large-scale thermal constrained natural gas pipeline networks: A novel iterative decomposition approach," Energy, Elsevier, vol. 282(C).
    15. Richard Krug & Günter Leugering & Alexander Martin & Martin Schmidt & Dieter Weninger, 2024. "A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 397-416, March.
    16. Mengying Xue & Tianhu Deng & Zuo‐Jun Max Shen, 2019. "Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 547-564, October.

    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. Carina Moreira Costa & Dennis Kreber & Martin Schmidt, 2022. "An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2968-2988, November.
    2. Blanco, Víctor & Fernández, Elena & Puerto, Justo, 2017. "Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods," European Journal of Operational Research, Elsevier, vol. 262(3), pages 863-878.
    3. Dimitris Bertsimas & Xuan Vinh Doan & Karthik Natarajan & Chung-Piaw Teo, 2010. "Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 580-602, August.
    4. Jan Pablo Burgard & Carina Moreira Costa & Martin Schmidt, 2024. "Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate," Annals of Operations Research, Springer, vol. 339(3), pages 1525-1568, August.
    5. Thomas Kleinert & Martin Schmidt, 2021. "Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 198-215, January.
    6. Skripnikov, A. & Michailidis, G., 2019. "Regularized joint estimation of related vector autoregressive models," Computational Statistics & Data Analysis, Elsevier, vol. 139(C), pages 164-177.
    7. Julia Grübel & Richard Krug & Martin Schmidt & Winnifried Wollner, 2023. "A Successive Linear Relaxation Method for MINLPs with Multivariate Lipschitz Continuous Nonlinearities," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1077-1117, September.
    8. Arvanitis, Stelios & Post, Thierry & Potì, Valerio & Karabati, Selcuk, 2021. "Nonparametric tests for Optimal Predictive Ability," International Journal of Forecasting, Elsevier, vol. 37(2), pages 881-898.
    9. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    10. Shujie Ma & Oliver Linton & Jiti Gao, 2017. "Estimation and inference in semiparametric quantile factor models," Monash Econometrics and Business Statistics Working Papers 8/17, Monash University, Department of Econometrics and Business Statistics.
    11. Mengying Xue & Tianhu Deng & Zuo‐Jun Max Shen, 2019. "Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 547-564, October.
    12. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    13. Tassouli, Siham & Lisser, Abdel, 2023. "A neural network approach to solve geometric programs with joint probabilistic constraints," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 205(C), pages 765-777.
    14. Pfeiffer, Pia & Alfons, Andreas & Filzmoser, Peter, 2025. "Efficient computation of sparse and robust maximum association estimators," Computational Statistics & Data Analysis, Elsevier, vol. 207(C).
    15. Er-Rahmadi, Btissam & Ma, Tiejun, 2022. "Data-driven mixed-Integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 337-353.
    16. Peng, Shen & Maggioni, Francesca & Lisser, Abdel, 2022. "Bounds for probabilistic programming with application to a blend planning problem," European Journal of Operational Research, Elsevier, vol. 297(3), pages 964-976.
    17. 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.
    18. Ming-Shr Lin & Chih-Sheng Chuang, 2024. "Adaptive Douglas–Rachford Algorithms for Biconvex Optimization Problem in the Finite Dimensional Real Hilbert Spaces," Mathematics, MDPI, vol. 12(23), pages 1-15, November.
    19. Martin Gugat & Günter Leugering & Alexander Martin & Martin Schmidt & Mathias Sirvent & David Wintergerst, 2018. "MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems," Computational Optimization and Applications, Springer, vol. 70(1), pages 267-294, May.
    20. Luciano Barcellos-Paula & José M. Merigó & Anna M. Gil-Lafuente, 2024. "100 volumes of Mathematical Methods of Operations Research: a bibliometric overview," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(3), pages 753-796, December.

    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:inm:orijoc:v:30:y:2018:i:2:p:309-323. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.