.png){kind=icon}
返回
A new evolutionary algorithm based on contraction method for many-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.07.069.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The convergence ability of Pareto-based evolutionary algorithms sharply reduces for many objective optimization problems because solutions are difficult to rank by the Pareto dominance due to large size of non-dominance area. In order to tackle the problem, a new contraction method on non-dominance area is proposed to rank solutions. The method makes the objective space as well as the no-dominance area be contracted into smaller regions. In order to get reasonable selection pressure and maintain the diversity of solutions, the contraction degree for different solutions is different, i.e., for solutions close to Pareto optimal solutions the degree of contraction is bigger. Then a new multi-objective evolutionary algorithm based on the new contraction method and orthogonal crossover operator with quantification technique (QOX) is designed for many-objective problems. Experimental results show that the proposed approach can guide the search to converge to the Pareto optimal front (PF) for many-objective optimization problems. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Many-objective optimization
Ranking
Orthogonal crossover operator
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容