A dynamic aggregation strategy enhanced efficient global optimization algorithm for solving high-dimensional turbomachinery design problems
To address challenges effectively in turbomachinery design optimization involving high-dimensional $ (d\geq 30) $ ( d ≥ 30 ) expensive black-box problems, a dedicated Efficient Global Optimization (EGO) algorithm is proposed with dynamic aggregation. This specialized approach efficiently navigates o...
Saved in:
| Published in: | Engineering optimization Vol. 57; no. 2; pp. 514 - 542 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Taylor & Francis
01.02.2025
|
| Subjects: | |
| ISSN: | 0305-215X, 1029-0273 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To address challenges effectively in turbomachinery design optimization involving high-dimensional
$ (d\geq 30) $
(
d
≥
30
)
expensive black-box problems, a dedicated Efficient Global Optimization (EGO) algorithm is proposed with dynamic aggregation. This specialized approach efficiently navigates optimization tasks with limited sample evaluations. Specifically, the Dynamic Aggregate Efficient Global Optimization (DA-EGO) algorithm decomposes the original high-dimensional design space into low-dimensional subspaces for efficient surrogate-based optimization search, and the optimal solutions of subspaces are combined as an elite-point for the global search. Most importantly, the subspace variables are updated in each iteration, according to the variable interaction analyses in the sub- and full-spaces. The perturbation method and the analysis of variance are used to detect variable interactions. After being validated on 21 benchmark functions ranging from 30 to 90 dimensions, the DA-EGO is used for the optimization of a transonic compressor rotor with 28 variables and a multi-stage compressor optimization with 60 variables. With the above, the effectiveness of the proposed algorithm is well demonstrated. |
|---|---|
| ISSN: | 0305-215X 1029-0273 |
| DOI: | 10.1080/0305215X.2024.2325651 |