Adaptive boosting learning evolutionary algorithm for complex many-objective optimization problems

被引：0
|
作者：
Hu Z.-Y. [1 ,2 ]
Li Y.-L. [1 ,2 ]
Wei Z.-H. [1 ,2 ]
Yang J.-M. [1 ,2 ]
机构：
[1] School of Electrical Engineering, Yanshan University, Qinhuangdao
[2] Engineering Research Center, The Ministry of Education for Intelligent Control System and Intelligent Equipment, Yanshan University, Qinhuangdao
来源：
Kongzhi yu Juece/Control and Decision | 2022年 / 37卷 / 11期
关键词：
adaptive boosting learning; adjustment of reference vector; complex Pareto front; decomposition; evolutionary algorithm; many-objective optimization;
D O I：
10.13195/j.kzyjc.2021.0725
中图分类号：
学科分类号：
摘要：
The evolutionary algorithm based on decomposition is an effective method in dealing with many-objective optimization problems. The traditional decomposition method relys on a set of uniformly distributed reference vectors, which decomposes the multi-objective optimization problem into a set of single-objective subproblems through aggregation functions, and then optimizes these subproblems simultaneously. However, these predefined reference vectors perform poorly in solving complex many-objective optimization problems because of the inconsistency of the distribution of reference vectors and the shape of the Pareto front. Aiming at the above problems, a many-objective evolutionary algorithm based on adaptive boosting learning (MaOEA-ABL) is proposed. The algorithm can be divided into two stages. In the first stage, an adaptive boosting learning algorithm is used to adjust the predefined reference vectors. In the learning process, useless vectors are deleted and new vectors are added. In the second stage, an unbiased decomposition method of Pareto shape is designed. Simulation has been conducted on the MaF test problems. The experimental results show that the IGD (inverted generational distance) mean value of MaOEA-ABL is better than that of the comparison algorithms in 67 % of the test functions, which indicates that the MaOEA-ABL performs well in many-objective optimization problems with complex Pareto front. © 2022 Northeast University. All rights reserved.
引用
收藏
页码：2849 / 2859
页数：10
相关论文
共 25 条
  • [1] Hu Z Y, Wei Z H, Sun H, Et al., Optimization of metal rolling control using soft computing approaches: A review, Archives of Computational Methods in Engineering, 28, 2, pp. 405-421, (2021)
  • [2] Tian H J, Wang L, Wu Q D., A hybrid framework of evolutionary algorithm for solving multi-objective optimization problems, Control and Decision, 32, 10, pp. 1729-1738, (2017)
  • [3] 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)
  • [4] Hu Z Y, Wei Z H, Ma X M, Et al., Multi-parameter deep-perception and many-objective autonomous-control of rolling schedule on high speed cold tandem mill, ISA Transactions, 102, pp. 193-207, (2020)
  • [5] Gu Q H, Mo M H, Lu C W, Et al., Decomposition-based constrained dominance principle NSGA- for constrained many-objective optimization problems, Control and Decision, 35, 10, pp. 2466-2474, (2020)
  • [6] Cai X J, Hu Z M, Chen J J., A many-objective optimization recommendation algorithm based on knowledge mining, Information Sciences, 537, pp. 148-161, (2020)
  • [7] Zhao Y L, Song Y X, Kang L W., Many-objective evolutionary algorithm based on vector angle decomposition, Control and Decision, 36, 3, pp. 761-768, (2021)
  • [8] Wu M Y, Li K, Kwong S, Et al., Evolutionary many-objective optimization based on adversarial decomposition, IEEE Transactions on Cybernetics, 50, 2, pp. 753-764, (2020)
  • [9] Asafuddoula M, Verma B, Zhang M J., A divide- and-conquer-based ensemble classifier learning by means of many-objective optimization, IEEE Transactions on Evolutionary Computation, 22, 5, pp. 762-777, (2018)
  • [10] Zhao H T, Zhang C S, Zhang B., A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points, Information Sciences, 540, pp. 435-448, (2020)
123