MOEA/D with a delaunay triangulation based weight adjustment

Abstract

MOEA/D decomposes a multi-objective optimization problem (MOP) into a set of scalar sub-problems with evenly spread weight vectors. Recent studies have shown that the fixed weight vectors used in MOEA/D might not be able to cover the whole Pareto front (PF) very well. Due to this, we developed an adaptive weight adjustment method in our previous work by removing subproblems from the crowded parts of the PF and adding new ones into the sparse parts. Although it performs well, we found that the sparse measurement of a subproblem which is determined by the m-nearest (m is the dimensional of the object space) neighbors of its solution can be more appropriately defined. In this work, the neighborhood relationship between subproblems is defined by using Delaunay triangulation (DT) of the points in the population.