.png){kind=icon}
.png){kind=icon}
Return
An objective reduction algorithm based on population decomposition and hyperplane approximation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101495.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Objective reduction is an efficient method to simplify many -objective optimization problems (MaOPs) with redundant objectives. However, most objective reduction algorithms operate on an entire sample set, which would easily omit local features and lead to an over -reduction of objectives. To alleviate the above problems, this paper proposes an objective reduction algorithm based on population decomposition and hyperplane approximation, denoted as PDHA, where the population is decomposed into several subpopulations, and a method based on hyperplane approximation is applied to extract the essential objectives from subpopulations. PDHA has two advantages. First, extracting essential objectives from the subpopulations could reduce errors produced by the reduction technique. Second, more attention is paid to local features via extracting the essential objectives from different subpopulations, which could prevent an over -reduction of objectives. The performance of PDHA is theoretically verified and experimentally compared with some state-of-theart objective reduction algorithms and some algorithms for MaOPs on some benchmark problems. The experimental results show that PDHA is effective for the objective reduction of objective -redundant MaOPs.
Keywords:
Evolutionary computations
Many-objective optimization
Objective reduction
Population decomposition
Hyperplane approximation
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W