返回
Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization
DOI:10.1109/TEVC.2018.2855411.png)
摘要
En 中文
When solving constrained multiobjective optimization problems, an important issue is how to balance convergence, diversity, and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained multiobjective optimization. It maintains two collaborative archives simultaneously: one, denoted as the convergence-oriented archive (CA), is the driving force to push the population toward the Pareto front; the other one, denoted as the diversity-oriented archive (DA), mainly tends to maintain the population diversity. In particular, to complement the behavior of the CA and provide as much diversified information as possible, the DA aims at exploring areas under-exploited by the CA including the infeasible regions. To leverage the complementary effects of both archives, we develop a restricted mating selection mechanism that adaptively chooses appropriate mating parents from them according to their evolution status. Comprehensive experiments on a series of benchmark problems and a real-world case study fully demonstrate the competitiveness of our proposed algorithm, in comparison to five state-of-the-art constrained evolutionary multiobjective optimizers.
Keyword:
Constraint handling
evolutionary algorithm (EA)
decomposition-based technique
multiobjective optimization
two-archive strategy
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
引用论文
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States
PLoS ONE
IF0
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization
SOFT COMPUTING
IF2.5

