Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization.
Saved in:
| Title: | Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization. |
|---|---|
| Authors: | Chen, Weichao, Li, Ziyang, Yu, Jiong, Pu, Yonglin |
| Source: | Complex & Intelligent Systems; Feb2026, Vol. 12 Issue 2, p1-17, 17p |
| Abstract: | With the increasing complexity of real-world engineering applications, expensive multi-objective optimization problems (EMOPs) have become prevalent. To alleviate the high computational cost associated with EMOPs, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed. However, most existing SAEAs exhibit performance degradation when applied to high-dimensional problems due to difficulties in surrogate modeling and optimization scalability. To address this challenge, we propose a novel SAEA called GSAEA (Grouping via Sensitivity Analysis Evolutionary Algorithm). Specifically, GSAEA employs sensitivity analysis and difference in contributions to group decision variables into convergence-related variables and diversity-related variables so as to perform targeted optimization for each subset. Furthermore, to further improve the accuracy of surrogate modeling, it constructs multiple radial basis function models to handle different optimization tasks separately. Finally, an infill sampling criterion selects the most promising candidate solutions for real functional evaluations. Experimental results on benchmark test suites containing up to 200 decision variables as well as on a high-dimensional real-world problem show that GSAEA outperforms several state-of-the-art SAEAs in terms of convergence and computational efficiency. [ABSTRACT FROM AUTHOR] |
| Copyright of Complex & Intelligent Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Be the first to leave a comment!
Full Text Finder
Nájsť tento článok vo Web of Science