Research Area: Metaheuristic Computing
Many industrial engineering problems involve complex formulations and are assisted by simulation tools. Although these tools provide highly accurate solutions, they may not be suitable for large scale problems and for optimization applications. Looking for alternatives to complex formulations that often lead to convergence issues and to time consuming solutions, the use of surrogate modeling for reaction systems is addressed herein. We propose a novel adaptive sampling algorithm that iteratively explores the solution space and incorporates ideas from adaptive sampling, trust region methods, and successive linear programming approaches. The surrogates are iteratively embedded into optimization problems to check feasibility and to collect insights to the following adaptive sampling iteration. The methodology is applied to a reaction system network and the surrogates are built to predict the reactor outputs. The adaptive sampling algorithm builds highly accurate surrogates that can be embedded into the reaction system optimization leading to near optimal solutions.
Keywords:
Aadaptive sampling
surrogate model
optimization of reaction systems
Author(s) Name: Robert E. Franzoi, Jeffrey D. Kelly, Brenno C. Menezes, Christopher L.E. Swartz
Journal name: Computers & Chemical Engineering
Conferrence name:
Publisher name: Springer
DOI: 10.1016/j.compchemeng.2021.107371
Volume Information: Volume 152, September 2021, 107371
