Abstract
Diversity preservation is a crucial technique in multiobjective evolutionary algorithms (MOEAs), which aims at evolving the population toward the Pareto front (PF) with a uniform distribution and a good extensity. In spite of many diversity preservation approaches in existing MOEAs, most of them encounter difficulties in tackling complex PFs. This article gives a detail introduction to existing diversity preservation approaches, as well as a revelation of the limitations of them. To address the limitations of existing diversity preservation approaches, this article proposes a multistage MOEA for better diversity performance. The proposed MOEA divides the optimization process into multiple stages according to the population in each generation, and updates the population by different steady-state selection schemes in different stages. According to the experimental results on 21 benchmark problems, the proposed MOEA exhibits better diversity performance than 11 existing MOEAs.
| Original language | English |
|---|---|
| Article number | 8937507 |
| Pages (from-to) | 5880-5894 |
| Number of pages | 15 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics: Systems |
| Volume | 51 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - Sept 2021 |
| Externally published | Yes |
Keywords
- Diversity preservation
- evolutionary algorithm
- multiobjective optimization
- Pareto front (PF)
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering