返回
Many-objective evolutionary algorithm based on adaptive weighted decomposition
DOI:10.1016/j.asoc.2019.105731.png)
摘要
En 中文
Decomposition is a representative method for handling many-objective optimization problems with evolutionary algorithms. Classical decomposition scheme relies on a set of uniformly distributed reference vectors to divide the objective space into multiple subregions. This scheme often works poorly when the problem has an irregular Pareto front due to the inconsistency between the distribution of reference vectors and the shape of Pareto fronts. We propose in this paper an adaptive weighted decomposition based many-objective evolutionary algorithm to tackle complicated many-objective problems whose Pareto fronts may or may not be regular. Unlike traditional decomposition based algorithms that use a pre-defined set of reference vectors, the reference vectors in the proposed algorithm are produced from the population during the search. The experiments show that the performance of the proposed algorithm is competitive with other state-of-the-art algorithms and is less-sensitive to the irregularity of the Pareto fronts. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Many-objective optimization
Evolutionary algorithm
Objective space decomposition
Adaptive weight generation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量

