Decomposition and cluster based expensive many-objective evolutionary algorithm

被引：0
|
作者：
Xu S.-S. [1 ]
Li J.-H. [1 ]
Li L. [1 ]
Li M. [1 ]
机构：
[1] Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition, Nanchang Hangkong University, Nanchang
来源：
Kongzhi yu Juece/Control and Decision | 2024年 / 39卷 / 02期
关键词：
cluster algorithm; evolutionary algorithm; expensive many-objective optimization; infill criterion; Kriging model; reference vector;
D O I：
10.13195/j.kzyjc.2022.0744
中图分类号：
学科分类号：
摘要：
When using evolutionary algorithms to solve expensive many-objective optimization problems, the many-objective leads to difficulties in balancing convergence and diversity and makes convergence difficult when computational resources are limited due to high consumption costs. Therefore, this paper proposes a decomposition and cluster based expensive many-objective evolutionary algorithm (DC-EMEA), which uses the Kriging model to approximate the objective function and reduces the number of evaluations of real expensive functions. When the optimizer searches for the optimal solution set of the model, the objective space is decomposed with the help of the reference vector, which is conducive to the balance of convergence and diversity. At the same time, two rounds of selection are adopted to ensure that the offspring population size is the same as that of the parents, providing more options for the selection of individuals for real evaluation by the infill criterion and improving the search efficiency. Meanwhile, an adaptive infill criterion is proposed to firstly divide the population into k subpopulations using the K-means algorithm. Then, by dividing the neighborhood, the subpopulations are adaptively divided into different types, and individuals are selected according to the types of subpopulations to improve the utilization of computational resources. In the selection of individuals, the focus is on the maintenance of convergence pressure to improve the convergence speed. Finally, the selected individuals are used to update the model and the archive. The experiments show that the DC-EMEA can balance convergence and diversity well and has a strong convergence ability. © 2024 Northeast University. All rights reserved.
引用
收藏
页码：440 / 448
页数：8
相关论文
共 24 条
  • [1] Jin Y C, Sendhoff B., A systems approach to evolutionary multiobjective structural optimization and beyond, IEEE Computational Intelligence Magazine, 4, 3, pp. 62-76, (2009)
  • [2] Zhou A M, Qu B Y, Li H, Et al., Multiobjective evolutionary algorithms: A survey of the state of the art, Swarm and Evolutionary Computation, 1, 1, pp. 32-49, (2011)
  • [3] Regis R G., Evolutionary programming for high-dimensional constrained expensive black-box optimization using radial basis functions, IEEE Transactions on Evolutionary Computation, 18, 3, pp. 326-347, (2014)
  • [4] Giannakoglou K C., Design of optimal aerodynamic shapes using stochastic optimization methods and computational intelligence, Progress in Aerospace Sciences, 38, 1, pp. 43-76, (2002)
  • [5] Jin Y, Olhofer M, Sendhoff B., A framework for evolutionary optimization with approximate fitness functions, IEEE Transactions on Evolutionary Computation, 6, 5, pp. 481-494, (2002)
  • [6] Liu J C, Zhao Y J, Li F, Et al., Expensive multi-objective optimization algorithm based on R2 indicator, Control and Decision, 35, 4, pp. 823-832, (2020)
  • [7] Pan L Q, He C, Tian Y, Et al., A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization, IEEE Transactions on Evolutionary Computation, 23, 1, pp. 74-88, (2019)
  • [8] Zhang J Y, Zhou A M, Zhang G X., A classification and Pareto domination based multiobjective evolutionary algorithm, 2015 IEEE Congress on Evolutionary Computation, pp. 2883-2890, (2015)
  • [9] Hao H, Zhou A M, Qian H, Et al., Expensive multiobjective optimization by relation learning and prediction, IEEE Transactions on Evolutionary Computation, 26, 5, pp. 1157-1170, (2022)
  • [10] Knowles J., ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, 10, 1, pp. 50-66, (2006)
123