Evolutionary Search with Multiple Utopian Reference Points in Decomposition-Based Multiobjective Optimization

Abstract EN

Decomposition-based multiobjective evolutionary algorithms (MOEA/Ds) have become increasingly popular in recent years.

In these MOEA/Ds, evolutionary search is guided by the used weight vectors in decomposition function to approximate the Pareto front (PF).

Generally, the decomposition function will be constructed by the weight vectors and the reference point, which play an important role to balance convergence and diversity during the evolutionary search.

However, in most existing MOEA/Ds, only one ideal point is used as the reference point for all the evolutionary search, which is harmful to search the entire PF when tackling the problems with difficult-to-approximate PF boundaries.

To address the above problem, this paper proposes an evolutionary search method with multiple utopian reference points in MOEA/Ds.

Similar to the existing MOEA/Ds, each solution is associated with one weight vector, which provides an evolutionary search direction, while the novelty of our approach is to use multiple utopian reference points, which can provide evolutionary search directions for different weight vectors.

Corner solutions are used to approximate the nadir point and then multiple utopian reference points for evolutionary search can be constructed based on the ideal point and the nadir point, which are uniformly distributed on the coordinate axis or planes.

The use of these utopian points can prevent solutions to gather in the same region of PF and helps to strike a good balance of exploration and exploitation in the search space.

The performance of our proposed algorithm is validated on tackling 16 recently proposed test problems with difficult-to-approximate PF boundaries and empirically compared to eight state-of-the-art multiobjective evolutionary algorithms.

The experimental results demonstrate the superiority of the proposed algorithm on solving most of the test problems adopted.