.png){kind=icon}
Return
Improved SparseEA for sparse large-scale multi-objective optimization problems
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-021-00553-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse large-scale multi-objective optimization problems (LSMOPs) widely exist in real-world applications, which have the properties of involving a large number of decision variables and sparse Pareto optimal solutions, i.e., most decision variables of these solutions are zero. In recent years, sparse LSMOPs have attracted increasing attentions in the evolutionary computation community. However, all the recently tailored algorithms for sparse LSMOPs put the sparsity detection and maintenance in the first place, where the nonzero variables can hardly be optimized sufficiently within a limited budget of function evaluations. To address this issue, this paper proposes to enhance the connection between real variables and binary variables within the two-layer encoding scheme with the assistance of variable grouping techniques. In this way, more efforts can be devoted to the real part of nonzero variables, achieving the balance between sparsity maintenance and variable optimization. According to the experimental results on eight benchmark problems and three real-world applications, the proposed algorithm is superior over existing state-of-the-art evolutionary algorithms for sparse LSMOPs.
Keywords:
Large-scale multi-objective optimization
Sparse pareto optimal solutions
Evolutionary algorithm
Real-world applications
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveShareSaveShareSaveShareSave
View more