4.7 Article

Complementary surrogate-assisted differential evolution algorithm for expensive multi-objective problems under a limited computational budget

期刊

INFORMATION SCIENCES
卷 632, 期 -, 页码 791-814

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2023.03.005

关键词

Expensive multi-objective problems; Differential evolution; Surrogate-based local search; Maximin angle-distance sampling; Infill criterion

向作者/读者索取更多资源

This study proposes an efficient surrogate-assisted differential evolution algorithm by hybridizing two complementary strategies to optimize expensive multi-objective problems with limited computational resources. One strategy is an improved local search method based on maximin angle-distance sequential sampling. The other strategy is prescreening based on a diversity-enhanced expected improvement matrix infill criterion.
Different surrogate-assisted strategies can greatly influence the optimization efficiency of surrogate-assisted multi-objective evolutionary algorithms. By hybridizing two complementary surrogate-assisted strategies, this study proposed an efficient surrogate-assisted differential evo-lution algorithm to optimize expensive multi-objective problems under a limited computational budget. The two proposed surrogate-assisted strategies balance global and local search for multi -objective optimization. Specifically, one strategy is an improved surrogate-based multi-objective local search method that is based on maximin angle-distance sequential sampling. Compared with the previous local search method that is based on Euclidian distance-based sampling, the improved local search method is more efficient because it can mitigate the scale difference of different objectives. The other surrogate-assisted strategy is prescreening based on a diversity -enhanced expected improvement matrix infill criterion. The proposed infill criterion aims to improve the diversity of approximate Pareto optimal solutions by considering distribution of candidate individuals in the objective space in the infill function. Within a limited computational burden, the performance of the proposed algorithm is demonstrated on a large set of multi -objective benchmark problems, as well as a real-world airfoil design problem. Experimental re-sults show that the proposed algorithm performs significantly better than some existing algo-rithms on most problems investigated in this study.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据