Abstract

In the expensive structural optimization, the data-driven surrogate model has been proven to be an effective alternative to physical simulation (or experiment). However, the static surrogate-assisted evolutionary algorithm (SAEA) often becomes powerless and inefficient when dealing with different types of expensive optimization problems. Therefore, how to select high-reliability surrogates to assist an evolutionary algorithm (EA) has always been a challenging task. This study aimed to dynamically provide an optimal surrogate for EA by developing a brand-new SAEA framework. Firstly, an adaptive surrogate model (ASM) selection technology was proposed. In ASM, according to different integration criteria from the strategy pool, elite meta-models were recombined into multiple ensemble surrogates in each iteration. Afterward, a promising model was adaptively picked out from the model pool based on the minimum root of mean square error (RMSE). Secondly, we investigated a novel ASM-based EA framework, namely ASMEA, where the reliability of all models was updated in real-time by generating new samples online. Thirdly, to verify the performance of the ASMEA framework, two instantiation algorithms are widely compared with several state-of-the-art algorithms on a commonly used benchmark test set. Finally, a real-world antenna structural optimization problem was solved by the proposed algorithms. The results demonstrate that the proposed framework is able to provide a high-reliability surrogate to assist EA in solving expensive optimization problems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.