Improved ensemble learning classification based surrogate-assisted evolutionary algorithm

被引:0
|
作者
Gu Q.-H. [1 ]
Zhang X.-Y. [1 ]
Chen L. [1 ]
机构
[1] (1. School of Management,Xi’an University of Architecture and Technology,Xi’an 710055,China;2. Xi’an Key Laboratory of Smart Industry Perception Computing and Decision Making,Xi’an 710055,China)
来源
Kongzhi yu Juece/Control and Decision | 2022年 / 37卷 / 10期
关键词
bagging; classifier; ensemble learning; expensive many-objective optimization; surrogate; surrogate-assisted evolutionary algorithm;
D O I
10.13195/j.kzyjc.2021.0388
中图分类号
学科分类号
摘要
When using surrogate-assisted evolutionary algorithm to solve the expensive many-objective optimization problems, the surrogate is usually used to approximate the expensive fitness function. However, with the increase of the number of objectives, the approximation error will accumulate gradually and the amount of calculation will increase sharply. In order to solve this problem, we propose an improved ensemble learning classification based surrogate-assisted evolutionary algorithm, which uses an improved bagging ensemble as the surrogate. Firstly, a set of classification boundary individuals are selected from the individuals evaluated by the expensive fitness function, and the individuals are divided into two groups. Then, these individuals with the group labels are used to train a classifier to predict the groups of the candidate individuals. Finally, the promising individuals are selected to be evaluated by the expensive fitness function. The experimental results show that the proposed surrogate in the algorithm effectively improves the ability of the classification based surrogate-assisted evolutionary algorithm to solve the expensive many-objective optimization problems, and compared with the current popular surrogate-assisted evolutionary algorithms, the proposed improved ensemble learning classification based surrogate-assisted evolutionary algorithm is more competitive. © 2022 Northeast University. All rights reserved.
引用
收藏
页码:2456 / 2466
页数:10
相关论文
共 32 条
  • [1] Liu J C, Li F, Wang H H, Et al., Survey on evolutionary many-objective optimization algorithms, Control and Decision, 33, 5, pp. 879-887, (2018)
  • [2] Gu Q H, Chen H Y, Chen L, Et al., A many-objective evolutionary algorithm with reference points-based strengthened dominance relation, Information Sciences, 554, pp. 236-255, (2021)
  • [3] 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)
  • [4] Douguet D., E-LEA3D: A computational-aided drug design web server, Nucleic Acids Research, 38, pp. W615-W621, (2010)
  • [5] Jin Y C., Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evolutionary Computation, 1, 2, pp. 61-70, (2011)
  • [6] Gu Q H, Wang Q, Li X X, Et al., A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems, Knowledge-Based Systems, 223, (2021)
  • [7] Gu Q H, Zhou Y F, Li X X., Expensive multi-objective evolutionary algorithm based on radial space partition, Acta Automatica Sinica, 47, pp. 1-21, (2021)
  • [8] Wilson B, Cappelleri D, Simpson T W., Efficient Pareto frontier exploration using surrogate approximations, Optimization and Engineering, 2, 1, pp. 31-50, (2001)
  • [9] 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)
  • [10] Theil H., A rank-Invariant method of linear and polynomial regression analysis, Henri Theil’s Contributions to Economics and Econometrics, pp. 345-381, (1992)