4.7 Article

Paired Offspring Generation for Constrained Large-Scale Multiobjective Optimization

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2020.3047835

关键词

Statistics; Sociology; Optimization; Signal processing algorithms; Pareto optimization; Convergence; Constraint handling; Constraint handling; evolutionary algorithm (EA); large-scale optimization; many-objective optimization; multiobjective optimization

资金

  1. National Natural Science Foundation of China [61903178, 61906081, 61906001, U1804262]
  2. Program for Guangdong Introducing Innovative and Entrepreneurial Teams [2017ZT07X386]
  3. Shenzhen Peacock Plan [KQTD2016112514355531]
  4. Program for University Key Laboratory of Guangdong Province [2017KSYS008]
  5. Hong Kong Scholars Program [XJ2019035]

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

This paper proposes a multiobjective EA algorithm based on paired offspring generation for constrained large-scale optimization problems, which highlights the role of offspring generation in producing promising feasible or useful infeasible offspring solutions. The algorithm first constructs subpopulations with fixed number of neighborhood solutions using a small set of reference vectors and then adopts a pairing strategy to determine parent solutions for offspring generation.
Constrained multiobjective optimization problems (CMOPs) widely exist in real-world applications, and they are challenging for conventional evolutionary algorithms (EAs) due to the existence of multiple constraints and objectives. When the number of objectives or decision variables is scaled up in CMOPs, the performance of EAs may degenerate dramatically and may fail to obtain any feasible solutions. To address this issue, we propose a paired offspring generation-based multiobjective EA for constrained large-scale optimization. The general idea is to emphasize the role of offspring generation in reproducing some promising feasible or useful infeasible offspring solutions. We first adopt a small set of reference vectors for constructing several subpopulations with a fixed number of neighborhood solutions. Then, a pairing strategy is adopted to determine some pairwise parent solutions for offspring generation. Consequently, the pairwise parent solutions, which could be infeasible, may guide the generation of well-converged solutions to cross the infeasible region(s) effectively. The proposed algorithm is evaluated on CMOPs with up to 1000 decision variables and ten objectives. Moreover, each component in the proposed algorithm is examined in terms of its effect on the overall algorithmic performance. Experimental results on a variety of existing and our tailored test problems demonstrate the effectiveness of the proposed algorithm in constrained large-scale multiobjective optimization.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据