.png){kind=icon}
Return
A decomposition-based multi-objective evolutionary algorithm with quality indicator
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2017.11.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
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
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more