Return
Recursive grouping and dynamic resource allocation method for large-scale multi-objective optimization problem
DOI:10.1016/j.asoc.2022.109651.png)
Abstract
En 中文
For large-scale multi-objective optimization problems (LSMOPs), the core problem is to overcome the curse of dimensionality. Cooperate coevolution has been proven to overcome this difficulty to a certain extent, which decomposes the decision variables into a number of groups and optimizes them in a cooperative coevolutionary manner, so a good decomposition method is particularly important. However, existing decomposition methods are usually computationally expensive. In this paper, a method for detecting the interaction of decision variables in LSMOPs is proposed. It first transforms a multi-objective optimization problem into a single-objective problem. Then, recursive grouping is applied, which can detect the relationship between a decision variable and the other ones recursively and put all interacting decision variables into the same group to get better grouping results with fewer function evaluations. Once groups are determined, by analyzing the contribution of each group to the problem, the group with higher contribution will be allocated more function evaluations to perform optimization. Experimental results show that the proposed framework has competitive performance compared with four state-of-the-art algorithms. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Large-scale multi-objective optimization
problem
Decomposition method
Cooperative coevolution
Dynamic resource allocation
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
Transcranial direct current stimulation on prefrontal and parietal areas enhances motor imagery
NeuroReport
IF0

