TY - JOUR
T1 - Efficient hybrid multiobjective optimization of pressure swing adsorption
AU - Hao, Zhimian
AU - Caspari, Adrian
AU - Schweidtmann, Artur M.
AU - Vaupel, Yannic
AU - Lapkin, Alexei A.
AU - Mhamdi, Adel
PY - 2021
Y1 - 2021
N2 - Pressure swing adsorption (PSA) is an energy-efficient technology for gas separation, while the multiobjective optimization of PSA is a challenging task. To tackle this, we propose a hybrid optimization framework (TSEMO + DyOS), which integrates two steps. In the first step, a Bayesian stochastic multiobjective optimization algorithm (i.e., TSEMO) searches the entire decision space and identifies an approximated Pareto front within a small number of simulations. Within TSEMO, Gaussian process (GP) surrogate models are trained to approximate the original full process models. In the second step, a gradient-based deterministic algorithm (i.e., DyOS) is initialized at the approximated Pareto front to further refine the solutions until local optimality. Therein, the full process model is used in the optimization. The proposed hybrid framework is efficient, because it benefits from the coarse-to-fine function evaluations and stochastic-to-deterministic searching strategy. When the result is far away from the optima, TSEMO can efficiently approximate a trade-off curve as good as a commonly used evolutional algorithm, i.e., Nondominated Sorting Genetic Algorithm II (NSGA-II), while TSEMO only uses around 1/16th of CPU time of NSGA-II. This is because the GP-based surrogate model is utilized for function evaluations in the initial coarse search. When the result is near the optima, the searching efficiency of TSEMO dramatically decreases, while DyOS can accelerate the searching efficiency by over 10 times. This is because, in the proximity of optima, the exploitation capacity of DyOS is significantly higher than that of TSEMO.
AB - Pressure swing adsorption (PSA) is an energy-efficient technology for gas separation, while the multiobjective optimization of PSA is a challenging task. To tackle this, we propose a hybrid optimization framework (TSEMO + DyOS), which integrates two steps. In the first step, a Bayesian stochastic multiobjective optimization algorithm (i.e., TSEMO) searches the entire decision space and identifies an approximated Pareto front within a small number of simulations. Within TSEMO, Gaussian process (GP) surrogate models are trained to approximate the original full process models. In the second step, a gradient-based deterministic algorithm (i.e., DyOS) is initialized at the approximated Pareto front to further refine the solutions until local optimality. Therein, the full process model is used in the optimization. The proposed hybrid framework is efficient, because it benefits from the coarse-to-fine function evaluations and stochastic-to-deterministic searching strategy. When the result is far away from the optima, TSEMO can efficiently approximate a trade-off curve as good as a commonly used evolutional algorithm, i.e., Nondominated Sorting Genetic Algorithm II (NSGA-II), while TSEMO only uses around 1/16th of CPU time of NSGA-II. This is because the GP-based surrogate model is utilized for function evaluations in the initial coarse search. When the result is near the optima, the searching efficiency of TSEMO dramatically decreases, while DyOS can accelerate the searching efficiency by over 10 times. This is because, in the proximity of optima, the exploitation capacity of DyOS is significantly higher than that of TSEMO.
KW - Bayesian optimization
KW - Gradient-based deterministic optimization
KW - Pressure swing adsorption
UR - http://www.scopus.com/inward/record.url?scp=85107662956&partnerID=8YFLogxK
U2 - 10.1016/j.cej.2021.130248
DO - 10.1016/j.cej.2021.130248
M3 - Article
AN - SCOPUS:85107662956
SN - 1385-8947
VL - 423
JO - Chemical Engineering Journal
JF - Chemical Engineering Journal
M1 - 130248
ER -