Deterministic Global Optimization of Multistage Membrane Gas Separation Using Surrogate Models

Author(s):  
Marius Hörnschemeyer ◽  
Christian Kunde
2019 ◽  
Author(s):  
Anders Andreasen

In this article the optimization of a realistic oil and gas separation plant has been studied. Two different fluids are investigated and compared in terms of the optimization potential. Using Design of Computer Experiment (DACE) via Latin Hypercube Sampling (LHS) and rigorous process simulations, surrogate models using Kriging have been established for selected model responses. The surrogate models are used in combination with a variety of different evolutionary algorithms for optimizing the operating profit, mainly by maximizing the recoverable oil production. A total of 10 variables representing pressure and temperature various key places in the separation plant are optimized to maximize the operational profit. The optimization is bounded in the variables and a constraint function is included to ensure that the optimal solution allows export of oil with an RVP < 12 psia. The main finding is that, while a high pressure is preferred in the first separation stage, apparently a single optimal setting for the pressure in downstream separators does not appear to exist. In the second stage separator apparently two different, yet equally optimal, settings are revealed. In the third and final separation stage a correlation between the separator pressure and the applied inlet temperature exists, where different combinations of pressure and temperature yields equally optimal results.<br>


2021 ◽  
Vol 86 ◽  
pp. 103740
Author(s):  
Maria S. Sergeeva ◽  
Nikita A. Mokhnachev ◽  
Dmitry N. Shablykin ◽  
Andrey V. Vorotyntsev ◽  
Dmitriy M. Zarubin ◽  
...  

Author(s):  
Chihsiung Lo ◽  
Panos Y. Papalambros

Abstract A powerful idea for deterministic global optimization is the use of global feasible search, namely, algorithms that guarantee finding feasible solutions of nonconvex problems or prove that none exists. In this article, a set of conditions for global feasible search algorithms is established. The utility of these conditions is demonstrated on two algorithms that solve special problem classes globally. Also, a new model transformation is shown to convert a generalized polynomial problem into one of the special classes above. A flywheel design example illustrates the approach. A sequel article provides further computational details and design examples.


2018 ◽  
Vol 482 (2) ◽  
pp. 225-228 ◽  
Author(s):  
D. A. Alentiev ◽  
M. V. Bermeshev ◽  
L. E. Starannikova ◽  
Yu. P. Yampolskii ◽  
E. Sh. Finkelshtein

2018 ◽  
Vol 1 (1) ◽  
Author(s):  
Tobias Keßler ◽  
Christian Kunde ◽  
Nick Mertens ◽  
Dennis Michaels ◽  
Achim Kienle

Sign in / Sign up

Export Citation Format

Share Document