Algebraic surrogate-based process optimization using Bayesian symbolic learning

9Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Here, we propose a strategy for the global optimization of process flowsheets, a fundamental problem in process systems engineering, based on algebraic surrogates that are built from rigorous simulations via Bayesian symbolic regression. The applied method provides a closed-form expression that can be optimized to global optimality using state-of-the-art solvers, where BARON or ANTIGONE were the solvers of choice. When predicting unseen test data, the algebraic models show a similar accuracy level compared to traditional surrogates based on Gaussian processes. However, they can be more easily optimized to global optimality due to their analytical closed-form structure, which allows the user to apply well-established global deterministic solvers. We show the capabilities of our approach in several case studies, ranging from process units to full flowsheets. The performance of our approach is assessed by comparing the CPU time for model building, the prediction accuracy of the identified model, and the CPU time for the subsequent optimization with a proven benchmark.

Cite

CITATION STYLE

APA

Forster, T., Vázquez, D., & Guillén-Gosálbez, G. (2023). Algebraic surrogate-based process optimization using Bayesian symbolic learning. AIChE Journal, 69(8). https://doi.org/10.1002/aic.18110

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free