Constrained efficient global multidisciplinary design optimization using adaptive disciplinary surrogate enrichment

Surrogate-based optimization has become a popular approach for solving problems with computationally expensive disciplinary solvers. Recently, the Efficient Global Multidisciplinary Design Optimization (EGMDO) algorithm was introduced as a surrogate-based algorithm for multidisciplinary optimization...

Full description

Saved in:
Bibliographic Details
Published inStructural and multidisciplinary optimization Vol. 67; no. 2; p. 23
Main Authors Cardoso, Inês, Dubreuil, Sylvain, Bartoli, Nathalie, Gogu, Christian, Salaün, Michel
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2024
Springer Nature B.V
Springer Verlag
Subjects
Algorithms
Computational Mathematics and Numerical Analysis
Constraint modelling
Design optimization
Engineering
Engineering Design
Engineering Sciences
Gaussian process
Multidisciplinary design optimization
Physics
Research Paper
Solvers
Theoretical and Applied Mechanics
Uncertainty
Constraint handling
Global optimization
Surrogate models
Multidisciplinary design optimization
OPTIMISATION MULTIDISCIPLINAIRE
OPTIMISATION GLOBALE
Online AccessGet full text

Cover

More Information
Summary:Surrogate-based optimization has become a popular approach for solving problems with computationally expensive disciplinary solvers. Recently, the Efficient Global Multidisciplinary Design Optimization (EGMDO) algorithm was introduced as a surrogate-based algorithm for multidisciplinary optimization, where the disciplinary solvers are replaced by Gaussian process (GP) surrogate models. A dedicated model of the resulting random objective function is then used to perform Bayesian optimization and focus the computational effort in promising areas of the design space. While its results are promising, the original EGMDO formulation does not provide a strategy for constraint handling. In this work we reformulate the original EGMDO algorithm to be able to handle both equality and inequality constraints. To do so, surrogate models of the constraint functions are first obtained. Then, the original uncertainty reduction strategy is adapted to account for the uncertainty introduced by the disciplinary GPs in both objective and constraint functions. The performance of the resulting algorithm, called Constrained-EGMDO (C-EGMDO), is then illustrated on a benchmark analytical MDO problem and on an engineering test case.
ISSN:1615-147X
1615-1488
DOI:10.1007/s00158-023-03736-0