A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Maximizing the storage capacity of gas networks: a global MINLP approach
https://orcid.org/0000-0001-9220-5289
https://orcid.org/0000-0002-3778-262X
Abstract In this paper, we study the transient optimization of gas networks, focusing in particular on maximizing the storage capacity of the network. We include nonlinear gas physics and active elements such as valves and compressors, which due to their switching lead to discrete decisions. The former is described by a model derived from the Euler equations that is given by a coupled system of nonlinear parabolic partial differential equations ($${\text{PDEs}}$$). We tackle the resulting mathematical optimization problem by a first-discretize-then-optimize approach. To this end, we introduce a new discretization of the underlying system of parabolic $${\text{PDEs}}$$ and prove well-posedness for the resulting nonlinear discretized system. Endowed with this discretization, we model the problem of maximizing the storage capacity as a non-convex mixed-integer nonlinear problem ($${\text{MINLP}}$$). For the numerical solution of the $${\text{MINLP}}$$, we algorithmically extend a well-known relaxation approach that has already been used very successfully in the field of stationary gas network optimization. This method allows us to solve the problem to global optimality by iteratively solving a series of mixed-integer problems. Finally, we present two case studies that illustrate the applicability of our approach.
Maximizing the storage capacity of gas networks: a global MINLP approach
https://orcid.org/0000-0001-9220-5289
https://orcid.org/0000-0002-3778-262X
Abstract In this paper, we study the transient optimization of gas networks, focusing in particular on maximizing the storage capacity of the network. We include nonlinear gas physics and active elements such as valves and compressors, which due to their switching lead to discrete decisions. The former is described by a model derived from the Euler equations that is given by a coupled system of nonlinear parabolic partial differential equations ($${\text{PDEs}}$$). We tackle the resulting mathematical optimization problem by a first-discretize-then-optimize approach. To this end, we introduce a new discretization of the underlying system of parabolic $${\text{PDEs}}$$ and prove well-posedness for the resulting nonlinear discretized system. Endowed with this discretization, we model the problem of maximizing the storage capacity as a non-convex mixed-integer nonlinear problem ($${\text{MINLP}}$$). For the numerical solution of the $${\text{MINLP}}$$, we algorithmically extend a well-known relaxation approach that has already been used very successfully in the field of stationary gas network optimization. This method allows us to solve the problem to global optimality by iteratively solving a series of mixed-integer problems. Finally, we present two case studies that illustrate the applicability of our approach.
Maximizing the storage capacity of gas networks: a global MINLP approach
https://orcid.org/0000-0001-9220-5289
https://orcid.org/0000-0002-3778-262X
Abstract In this paper, we study the transient optimization of gas networks, focusing in particular on maximizing the storage capacity of the network. We include nonlinear gas physics and active elements such as valves and compressors, which due to their switching lead to discrete decisions. The former is described by a model derived from the Euler equations that is given by a coupled system of nonlinear parabolic partial differential equations ($${\text{PDEs}}$$). We tackle the resulting mathematical optimization problem by a first-discretize-then-optimize approach. To this end, we introduce a new discretization of the underlying system of parabolic $${\text{PDEs}}$$ and prove well-posedness for the resulting nonlinear discretized system. Endowed with this discretization, we model the problem of maximizing the storage capacity as a non-convex mixed-integer nonlinear problem ($${\text{MINLP}}$$). For the numerical solution of the $${\text{MINLP}}$$, we algorithmically extend a well-known relaxation approach that has already been used very successfully in the field of stationary gas network optimization. This method allows us to solve the problem to global optimality by iteratively solving a series of mixed-integer problems. Finally, we present two case studies that illustrate the applicability of our approach.
Maximizing the storage capacity of gas networks: a global MINLP approach
Burlacu, Robert (author) / Egger, Herbert (author) / Groß, Martin (author) / Martin, Alexander (author) / Pfetsch, Marc E. (author) / Schewe, Lars (author) / Sirvent, Mathias (author) / Skutella, Martin (author)
2018
Article (Journal)
English
Maximizing the storage capacity of gas networks: a global MINLP approach
| Springer Verlag | 2018
MINLP approach to truss synthesis
| British Library Conference Proceedings | 2004
The MINLP approach to structural synthesis
| British Library Conference Proceedings | 2010
Comparison of MINLP formulations for global superstructure optimization
| DataCite | 2022
MINLP approach to the optimization of steel frames
| British Library Conference Proceedings | 2006