.png){kind=icon}
.png){kind=icon}
Return
Variable-Length Pareto Optimization via Decomposition-Based Evolutionary Multiobjective Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2019.2898886.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Optimization problems with variable-length decision space are a class of challenging optimization problems derived from some real-world applications, such as the composite laminate stacking problem and the sensor coverage problem. Unlike other optimization problems, the solutions in these problems might be represented as the vectors with different variable size (i.e., dimensionality). So far, some research efforts have been done on the use of evolutionary algorithms (EAs) for solving single objective variable-length optimization problems. In fact, the variable-length problem difficulty can also exist in multiobjective optimization. However, such challenging problems have not yet gained much attention in the area of evolutionary multiobjective optimization. To facilitate the research on the variable-length Pareto optimization, we first suggest a systematic toolkit for constructing benchmark multiobjective test problems with variable-length feature in this paper. Then, we also propose a variable-length multiobjective EA based on a two-level decomposition strategy, which decomposes a multiobjective optimization problem in terms of the penalty boundary intersection search directions and the dimensionality of variables. The performance of our proposed algorithm and the other three state-of-the-art algorithms on these problems are compared. To further show the effectiveness of our proposed algorithm, some experimental results on a bi-objective laminate stacking optimization problem are also reported and analyzed.
Keywords:
Optimization
Laminates
Linear programming
Sociology
Statistics
Stacking
Benchmark testing
Composite laminate optimization
MOEA
D
multiobjective optimization
variable-length structure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
View more organizations