.png){kind=icon}
Return
A Diversity-Enhanced Resource Allocation Strategy for Decomposition-Based Multiobjective Evolutionary Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2017.2739185.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multiobjective evolutionary algorithm (MOEA) based on decomposition transforms a multiobjective optimization problem into a set of aggregated subproblems and then optimizes them collaboratively. Since these subproblems usually have different degrees of difficulty, resource allocation (RA) strategies have been reported to enhance performance, attempting to dynamically assign proper amounts of computational resources for the solution of each of these subproblems. However, existing schemes for decomposition-based MOEAs fully rely on the relative improvement of the aggregated functions to do this. This paper proposes a diversity-enhanced RA strategy for this kind of MOEA, depending on both relative improvement on aggregated function value and solution density around each subproblem to assign computational resources. Thus, one subproblem surrounded with fewer solutions in its neighboring area and more relative improvement on the aggregated function value will be allocated a higher probability for evolution. Our experimental results show the advantages of our proposed strategy over two popular RA strategies available for decomposition-based MOEAs, on tackling a set of complicated benchmark problems.
Keywords:
Decomposition
multiobjective optimization
resource allocation (RA)
solution density
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
Geochemistry of basalts from IODP site U1365: Implications for magmatism and mantle source signatures of the mid-Cretaceous Osbourn Trough.png)
Lithos
LithosIF0
PREAI
ShareSave
ShareSaveShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSave
View more