.png){kind=icon}
返回
An angle based evolutionary algorithm with infeasibility information for constrained many-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2019.105911.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, angle-based approaches have shown promising for unconstrained many-objective optimization problems (MaOPs), but few of them are extended to solve constrained MaOPs (CMaOPs). Moreover, due to the difficulty in searching for feasible solutions in high-dimensional objective space, the use of infeasible solutions comes to be more important in solving CMaOPs. In this paper, an angle based evolutionary algorithm with infeasibility information is proposed for constrained many-objective optimization, where different kinds of infeasible solutions are utilized in environmental selection and mating selection. To be specific, an angle-based constrained dominance relation is proposed for non-dominated sorting, which gives infeasible solutions with good diversity the same priority to feasible solutions for escaping from the locally feasible regions. As for diversity maintenance, an angle-based density estimation is developed to give the infeasible solutions with good convergence a chance to survive for next generation, which is helpful to get across the large infeasible barrier. In addition, in order to utilize the potential of infeasible solutions in creating high-quality offspring, a modified mating selection is designed by considering the convergence, diversity and feasibility of solutions simultaneously. Experimental results on two constrained many-objective optimization test suites demonstrate the competitiveness of the proposed algorithm in comparison with five existing constrained many-objective evolutionary algorithms for CMaOPs. Moreover, the effectiveness of the proposed algorithm on a real-world problem is showcased. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Constrained many-objective optimization
Infeasibility information
Constrained dominance relation
Convergence
Diversity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Evolutionary Many-Objective Optimization: A Comparative Study of the State-of-the-Art.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏An improved NSGA-III algorithm based on elimination operator for many-objective optimization基于消去算子的改进nsga-iii多目标优化算法MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台OAAI
OAAI分享收藏
分享收藏Differential evolution mutation operators for constrained multi-objective optimization约束多目标优化的差分进化变异算子
PREAI
分享收藏A Scalar Projection and Angle-Based Evolutionary Algorithm for Many-Objective Optimization ProblemsOAAI
OAAI分享收藏
查看更多内容