High-Dimensional Constrained Multiobjective Optimization of a Fan Stage

Author:

Aulich Marcel1,Siller Ulrich1

Affiliation:

1. German Aerspace Center (DLR), Cologne, Germany

Abstract

A high-dimensional design space, different objectives, many constraints and a time-consuming process chain result in a complex task for any optimization tool. This paper shows methods and strategies used at DLR, Institute of Propulsion Technology, to handle this kind of problem. The present optimization task is a rotor-stator configuration with more than two hundred free design variables, two objective functions (efficiency, stall margin) and mechanical and aerodynamic constraints (mass flow, eigenfrequencies, etc.). The process chain consists of geometry and mesh generation, FEM-and 3D-CFD calculations for different operating points. After defining the setup and explaining the initial already 3-D-preoptimized configuration, the CFD/FEM optimization tool is described. This tool calculates the complete CFD/FEM process chain and creates new designs (also called members) by using an evolutionary algorithms. Parallel to the CFD/FEM optimization a program based on surrogate models is running. By using surrogate models a fast evaluation of new members is enabled. So a database of new members can be created quickly. Based on this database a set of new members is built. This is send to the CFD/FEM optimization tool, where the complete CFD/FEM process chain is applied. After the CFD/FEM evaluation process, these member are used to train the surrogate models again. This procedure repeats until the optimization goals are reached. In the next part of this paper the implemented surrogate models are discussed. Both neural networks and Kriging models have advantages and disadvantages compared to each other. It is important to understand them to choose the right model at the right time of optimization. The main focus of this paper is on the selection criterion for new members. This criterion has two targets: push the performance of the fan stage and enhance the surrogate models. At first sight these targets seem to be contrary, but the surrogate models do not predict a single mean value for an objective. They offer a density distribution of the potential objective values. That allows calculation of the Paretofront enhancement (ParetoEnSet) for a set of new members. ParetoEnSet is the expected area gain of a set of members to the current Paretofront. This criterion based on the already known expected improvement. It is shown, that ParetoEnSet can rise, when the uncertainty of an prediction increases. The uncertainty is estimated by a surrogate model. So new members tend to explore the design space, where the predicted uncertainty is huge. These members are favorable for improving the surrogate models. In addition, it is easy to couple constraints with ParetoEnSet. In the last section the results of the optimization are illustrated. Compared to baseline design the optimized stage accomplishes a notable improvement in efficiency by obtaining the stall margin and fulfilling multi aerodynamical and mechanical constraints.

Publisher

ASMEDC

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. The New Chapter of Transonic Compressor Cascade Design at the DLR;Journal of Turbomachinery;2023-04-03

2. Optimization of Slots-Groove Coupled Casing Treatment for an Axial Transonic Compressor;Journal of Turbomachinery;2020-07-28

3. Erweiterung des Betriebsbereiches durch Stabilisierungsmaßnahmen;Aerodynamik axialer Turbokompressoren;2020

4. Optimierungsverfahren;Aerodynamik axialer Turbokompressoren;2020

5. Some Aspects of the Transonic Compressor Tandem Design;Journal of Turbomachinery;2019-05-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3