Journal article · 2025 · Open access
Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization
Complex & Intelligent Systems, 12(2) · Published 26 December 2025 · DOI 10.1007/s40747-025-02160-9
In brief
“Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization” is a 2025 journal article by Weichao Chen and 3 co-authors, published in Complex & Intelligent Systems. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Complex & Intelligent Systems.
- Citations
- 0
- References
- 45
- Authors
- 4
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.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chen, W., Li, Z., Yu, J., & Pu, Y. (2025). Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization. Complex & Intelligent Systems, 12(2). https://doi.org/10.1007/s40747-025-02160-9
MLA 9
Chen, Weichao, et al. “Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization.” Complex & Intelligent Systems, vol. 12, no. 2, 2025. https://doi.org/10.1007/s40747-025-02160-9.
Chicago
Chen, Weichao, Ziyang Li, Jiong Yu, and Yonglin Pu. 2025. “Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization.” Complex & Intelligent Systems 12 (2). https://doi.org/10.1007/s40747-025-02160-9.
Harvard
Chen, W. et al. (2025) ‘Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization’, Complex & Intelligent Systems, 12(2). doi:10.1007/s40747-025-02160-9.
IEEE
W. Chen, Z. Li, J. Yu, and Y. Pu, “Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization,” Complex & Intelligent Systems, vol. 12, no. 2, 2025, doi: 10.1007/s40747-025-02160-9.
BibTeX
@article{chen2025grouping,
title = {{Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization}},
author = {Chen, Weichao and Li, Ziyang and Yu, Jiong and Pu, Yonglin},
journal = {Complex \& Intelligent Systems},
year = {2025},
volume = {12},
number = {2},
doi = {10.1007/s40747-025-02160-9},
url = {https://doi.org/10.1007/s40747-025-02160-9}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- expensive multi-objective optimization
- surrogate-assisted evolutionary algorithms
- sensitivity analysis
- variable grouping
- high-dimensional optimization
- radial basis function surrogate model
- convergence and diversity
- computational complexity reduction
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Chen, W., Li, Z., Yu, J., & Pu, Y. (2025). Grouping via sensitivity analysis evolutionary algorithm for high-dimensional expensive multi-objective optimization. Complex & Intelligent Systems, 12(2). https://doi.org/10.1007/s40747-025-02160-9
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Complex & Intelligent Systems: sign in and open the full text from this page.
Who wrote this paper?
Weichao Chen, Ziyang Li, Jiong Yu, Yonglin Pu.
What is the DOI of this paper?
10.1007/s40747-025-02160-9, permanently at https://doi.org/10.1007/s40747-025-02160-9. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.