Name
Abstract | ||
|---|---|---|
In the past several years, it has become apparent that the effectiveness of Pareto-dominance-based multiobjective evolutionary algorithms deteriorates progressively as the number of objectives in the problem, given by
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>
, grows. This is mainly due to the poor discriminability of Pareto optimality in many-objective spaces (typically
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M\geq 4$ </tex-math></inline-formula>
). As a consequence, research efforts have been driven in the general direction of developing solution ranking methods that do not rely on Pareto dominance (e.g., decomposition-based techniques), which can provide sufficient selection pressure. However, it is still a nontrivial issue for many existing non-Pareto-dominance-based evolutionary algorithms to deal with unknown irregular Pareto front shapes. In this article, a new many-objective evolutionary algorithm based on the generalization of Pareto optimality (GPO) is proposed, which is simple, yet effective, in addressing many-objective optimization problems. The proposed algorithm used an “(
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M-1$ </tex-math></inline-formula>
) + 1” framework of GPO dominance, (
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M-1$ </tex-math></inline-formula>
)-GPD for short, to rank solutions in the environmental selection step, in order to promote convergence and diversity simultaneously. To be specific, we apply
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>
symmetrical cases of (
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M-1$ </tex-math></inline-formula>
)-GPD, where each enhances the selection pressure of
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M-1$ </tex-math></inline-formula>
objectives by expanding the dominance area of solutions, while remaining unchanged for the one objective left out of that process. Experiments demonstrate that the proposed algorithm is very competitive with the state-of-the-art methods to which it is compared, on a variety of scalable benchmark problems. Moreover, experiments on three real-world problems have verified that the proposed algorithm can outperform the others on each of these problems. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TCYB.2021.3051078 | IEEE Transactions on Cybernetics |
Keywords | DocType | Volume |
Evolutionary algorithms,generalized Pareto optimality,many-objective optimization,Pareto dominance | Journal | 52 |
Issue | ISSN | Citations |
8 | 2168-2267 | 1 |
PageRank | References | Authors |
0.34 | 56 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuwei Zhu | 1 | 3 | 1.03 |
| Lihong Xu | 2 | 344 | 36.70 |
| Erik Goodman | 3 | 145 | 15.19 |
| Zhichao Lu | 4 | 58 | 5.93 |