Another difficulty of inverted triangular pareto fronts for decomposition-based multi-objective algorithms

He，Linjun1; Camacho，Auraham2; Ishibuchi，Hisao1

10.1145/3377930.3390196

2020-06-25

GECCO 2020 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference

498-506

A set of uniformly sampled weight vectors from a unit simplex has been frequently used in decomposition-based multi-objective algorithms. The number of the generated weight vectors is controlled by a user-defined parameter H. In the literature, good results are often reported on test problems with triangular Pareto fronts since the shape of the Pareto fronts is consistent with the distribution of the weight vectors. However, when a problem has an inverted triangular Pareto front, well-distributed solutions over the entire Pareto front are not obtained due to the inconsistency between the Pareto front shape and the weight vector distribution. In this paper, we demonstrate that the specification of H has an unexpected large effect on the performance of decomposition-based multi-objective algorithms when the test problems have inverted triangular Pareto fronts. We clearly explain why their performance is sensitive to the specification of H in an unexpected manner (e.g., H = 3 is bad but H = 4 is good for three-objective problems whereas H = 3 is good but H = 4 is bad for four-objective problems). After these discussions, we suggest a simple weight vector specification method for inverted triangular Pareto fronts.

Decomposition-based multi-objective algorithm Many-objective optimization Multi-objective optimization Pareto front shape Weight vectors

第一

英语

EI

20204009295584

Vectors ; Specifications

Codes and Standards:902.2 ; Algebra:921.1 ; Optimization Techniques:921.5

2-s2.0-85091795978

Scopus

1.Southern University of Science and Technology,Shenzhen,China
2.CINVESTAV Unidad Tamaulipas,Mexico

He，Linjun,Camacho，Auraham,Ishibuchi，Hisao. Another difficulty of inverted triangular pareto fronts for decomposition-based multi-objective algorithms[C],2020:498-506.