4.7 Article

A novel two-phase evolutionary algorithm for solving constrained multi-objective optimization problems

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 75, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2022.101166

关键词

Coevolution; Constraints; Evolutionary algorithms; Optimization algorithms

资金

  1. National Natural Science Foundation of China [61876164, 62176228]
  2. Natural Science Foundation of Hunan Province, China [2020JJ4590]
  3. Education Department Major Project of Hunan Province, China [17A212]
  4. MOEA Key Laboratory of Intelligent Computing and Information Processing
  5. Science and Technology Plan Project of Hunan Province, China [2016TP1020]
  6. Provinces and Cities Joint Foundation Project, China [2017JJ4001]
  7. Hunan province science and technology project, China funds [2018TP1036]

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

Balancing convergence and diversity in constrained multi-objective optimization problems is challenging. Existing evolutionary algorithms are insufficient, hence a novel algorithm named DTAEA is proposed. DTAEA divides the population's evolutionary process into two phases to improve exploration capability and guide population distribution in feasible regions.
It is challenging to balance convergence and diversity in constrained multi-objective optimization problems (CMOPs) since the complex constraints will disperse the feasible regions into many diverse, small parts of the entire search region. Although there has been some research on CMOPs, existing evolutionary algorithms still cannot cause the evolutionary population to converge a diversified feasible Pareto-optimal front. In order to solve this problem, we propose a novel two-phase evolutionary algorithm for solving CMOPs, named DTAEA. DTAEA divides the population's coevolutionary process into two phases. In the first phase, the dual population weak coevolution is combined with the complementary environmental selection strategy to improve the algorithm's exploration under constraints, which makes the evolutionary population quickly traverse the infeasible regions and search for all of the feasible regions. When the proportion of feasible solutions in the population reaches a certain threshold or the convergence of feasible solutions reaches a certain level, the population's evolutionary process enters the second phase, that is, the progressive phase. In the second phase, a feasibility-oriented method guides a single population to distribute itself widely in the feasible regions explored in the first phase. Comparative experiments show that the DTAEA is more competitive than other algorithms on CMOP benchmarks.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据