Two-Archive Evolutionary Algorithm Based on Multi-Search Strategy for Many-Objective Optimization
Taking both convergence and diversity into consideration, this paper proposes a two-archive an evolutionary algorithm based on multi-search strategy (TwoArchM) to cope with many-objective optimization problems. The basic idea is to use two separate archives to balance the convergence and diversity a...
Main Author: | Cai Dai |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8718272/ |
Similar Items
-
A Two-Archive Many-Objective Optimization Algorithm Based on D-Domination and Decomposition
by: Na Ye, et al.
Published: (2022-10-01) -
Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
by: Lining Xing, et al.
Published: (2022-12-01) -
A Dimension Convergence-Based Evolutionary Algorithm for Many-Objective Optimization Problems
by: Peng Wang, et al.
Published: (2020-01-01) -
A Distributed Bi-Behaviors Crow Search Algorithm for Dynamic Multi-Objective Optimization and Many-Objective Optimization Problems
by: Ahlem Aboud, et al.
Published: (2022-09-01) -
Performance Evaluation Metrics for Multi-Objective Evolutionary Algorithms in Search-Based Software Engineering: Systematic Literature Review
by: Jamal Abdullahi Nuh, et al.
Published: (2021-03-01)