Research on decomposition-based multi-objective evolutionary algorithm with dynamic weight vector

In recent years, multi -objective evolutionary algorithm based on decomposition has gradually attracted people 's interest. However, this algorithm has some problems. For example, the diversity of the algorithm is poor, and the convergence and diversity of the algorithm are unbalanced. In addition, users don 't always care about the entire Pareto front. Sometimes they may only be interested in specific areas of entire Pareto front. Based on the above problems, this paper proposes a decomposition -based multi -objective evolutionary algorithm with dynamic weight vector (MOEA/D-DWV). Firstly, a weight vector generation model with uniform distribution or preference distribution is proposed. Users can decide which type of weight vector to generate according to their own wishes. Then, two combination evolution operators are proposed to better balance the convergence and diversity of the algorithm. Finally, a dynamic adjustment strategy of weight vector is proposed. This strategy can adjust the distribution of weight vector adaptively according to the distribution of solutions in the objective space, so that the population can be uniformly distributed in the objective space as much as possible. MOEA/D-DWV algorithm is compared with 9 advanced multi -objective evolutionary algorithms. The comparison results show that MOEA/D-DWV algorithm is more competitive. Data availability: Data will be made available on request.