Efficient hybrid multiobjective optimization of pressure swing adsorption

Journal Article (2021)
Author(s)

Zhimian Hao (University of Cambridge)

Adrian Caspari (RWTH Aachen University)

A.M. Schweidtmann (TU Delft - ChemE/Product and Process Engineering, RWTH Aachen University)

Yannic Vaupel (RWTH Aachen University)

Alexei A. Lapkin (Cambridge Centre for Advanced Research and Education, University of Cambridge)

Adel Mhamdi (RWTH Aachen University)

Research Group
ChemE/Product and Process Engineering
Copyright
© 2021 Zhimian Hao, Adrian Caspari, A.M. Schweidtmann, Yannic Vaupel, Alexei A. Lapkin, Adel Mhamdi
DOI related publication
https://doi.org/10.1016/j.cej.2021.130248
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 Zhimian Hao, Adrian Caspari, A.M. Schweidtmann, Yannic Vaupel, Alexei A. Lapkin, Adel Mhamdi
Research Group
ChemE/Product and Process Engineering
Volume number
423
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

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.