返回
An improved NSGA-III algorithm based on objective space decomposition for many-objective optimization
DOI:10.1007/s00500-016-2192-0.png)
摘要
En 中文
Maintaining balance between convergence and diversity is of great importance for many-objective evolutionary algorithms. The recently suggested non-dominated sorting genetic algorithm III could obtain a fair diversity but the convergence is unsatisfactory. For this purpose, an improved NSGA-III algorithm based on objective space decomposition ( we call it NSGA-III-OSD) is proposed for enhancing the convergence of NSGA-III. Firstly, the objective space is decomposed into several subspaces by clustering the weight vectors uniformly distributed in the whole objective space and each subspace has its own population. Secondly, individual information is exchanged between subspaces in the mating selection phase. Finally, the convergence information is added in the environmental selection phase by the penalty-based boundary intersection distance. The proposed NSGA-III-OSD is tested on a number of many-objective optimization problems with three to fifteen objectives and compared with six state-of-the-art algorithms. Experimental results show that NSGA-III-OSD is competitive with the chosen state-of-the-art designs in convergence and diversity.
Keyword:
Many-objective optimization
NSGA-III
Convergence
Objective space decomposition
PBI distance
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
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多目标进化算法: 比较案例研究和强度帕累托方法
Calculation method of pumping characteristics of high-vacuum system with turbomolecular vacuum pump涡轮分子真空泵的高真空系统抽气特性计算方法

