Skip to main content
Log in

A clustering-based surrogate-assisted evolutionary algorithm (CSMOEA) for expensive multi-objective optimization

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper presents a novel surrogate-assisted evolutionary algorithm, CSMOEA, for multi-objective optimization problems (MOPs) with computationally expensive objectives. Considering most surrogate-assisted evolutionary algorithms (SAEAs) do not make full use of population information and only use population information in either the objective space or the design space independently, to address this limitation, we propose a new strategy for comprehensive utilization of population information of objective and design space. The proposed CSMOEA adopts an adaptive clustering strategy to divide the current population into good and bad groups, and the clustering centers in the design space are obtained, respectively. Then, a bi-level sampling strategy is proposed to select the best samples in both the design and objective space, using distance to the clustering centers and approximated objective values of radial basis functions. The effectiveness of CSMOEA is compared with five state-of-the-art algorithms on 21 widely used benchmark problems, and the results show high efficiency and a good balance between convergence and diversity. Additionally, CSMOEA is applied to the shape optimization of blend-wing-body underwater gliders with 14 decision variables and two objectives, demonstrating its effectiveness in solving real-world engineering problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Data availability

Data in this paper are available upon reasonable request.

References

Download references

Acknowledgements

This project is supported by the National Natural Science Foundation of China (Grant No. 52175251, 52205268) and the National Basic Scientific Research Program under Grant of JCKY2021206B005. Besides, the research work is also supported by the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University.

Funding

The authors have not disclosed any funding.

Author information

Authors and Affiliations

Authors

Contributions

Wenxin Wang contribution lies in the design, study conception and writing of the first draft. Huachao Dong and Peng Wang contribution lies in data collection and analysis, Xinjing Wang provided many constructive comments during the revision process and made significant contributions to improving the quality of this article. Jiangtao Shen provided assistance in completing the numerical experiment. The authors read and approved the final manuscript.

Corresponding author

Correspondence to Huachao Dong.

Ethics declarations

Conflict of interest

The all authors declare that there is no conflict of interest regarding the publication of this paper.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, W., Dong, H., Wang, P. et al. A clustering-based surrogate-assisted evolutionary algorithm (CSMOEA) for expensive multi-objective optimization. Soft Comput 27, 10665–10686 (2023). https://doi.org/10.1007/s00500-023-08227-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-08227-4

Keywords

Navigation