arrow
Return

A decomposition-based multi-objective evolutionary algorithm with quality indicator

delete2018-04-01
delete25
PRE
AI
J
Jianping Luo *
Y
Yun Yang
X
Xia Li
Q
Qiqi Liu
M
Min-Rong Chen
K
Kaizhou Gao
DOI:10.1016/j.swevo.2017.11.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The issue of integrating preference information into multi-objective optimization is considered, and a multi objective framework based on decomposition and preference information, called indicator-based MOEA/D (IBMOEA/D), is presented in this study to handle the multi-objective optimization problems more effectively. The proposed algorithm uses a decomposition-based strategy for evolving its working population, where each individual represents a subproblem, and utilizes a binary quality indicator-based selection for maintaining the external population. Information obtained from the quality improvement of individuals is used to determine which subproblem should be invested at each generation by a power law distribution probability. Thus, the indicator-based selection and the decomposition strategy can complement each other. Through the experimental tests on seven many-objective optimization problems and one discrete combinatorial optimization problem, the proposed algorithm is revealed to perform better than several state-of-the-art multi-objective evolutionary algorithms. The effectiveness of the proposed algorithm is also analyzed in detail.
Keywords:
Evolutionary computations
Multi-objective optimization
Algorithm diversity
Decomposition
Indicator-based
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.1K
Citations:
1.0W

Organization

N
Nanyang Technological University
Scholars:
4.9W
Papers: 4.8W
Citations: 8.1W
S
shenzhen university
Scholars:
4.5W
Papers: 3.4W
Citations: 72