.png){kind=icon}
Return
A two-archive model based evolutionary algorithm for multimodal multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2022.108606.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multimodal multi-objective optimization (MMO) can offer more elegant solutions and provide diverse decisions to decision-makers in real world optimization problems. Many multimodal evolutionary mechanisms have been proposed to explore and exploit two solution spaces (i.e. decision space and objective space) in recent years. However, most existing methods only use single evolutionary operator to generate offsprings and ignore the advantage of using hybrid evolutionary algorithm. Moreover, it is still a great challenge to balance the effectiveness and efficiency simultaneously in the evolutionary process of MMO. In view of this, an efficient Two-Archive model based multimodal evolutionary algorithm is proposed in this paper. Two parallel offspring generation mechanisms based on competitive particle swarm optimizer and differential evolution are applied to expand two solution spaces with different evolutionary requirements. Moreover, niching local search scheme and reverse vector mutation strategy play roles in achieving better convergence and diversity. Finally, 22 MMO test problems are used to validate the superiority of the proposed method by comparing it with 5 state-of-the-art MMO algorithms. The proposed method is also expanded to solve 9 feature selection problems for validating the effectiveness of the proposed method on real world applications. (C)& nbsp;2022 Elsevier B.V. All rights reserved.
Keywords:
Multimodal multi-objective optimization
Two-Archive
Evolutionary algorithm
Particle swarm optimizer
Differential evolution
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveThe Predictive Validity of the GRE Across Graduate Outcomes: A Meta-Analysis of Trends Over Time
OAAI
OAAIShareSaveShareSaveShareSaveShareSave
View more