An Improved Multiobjective Algorithm: DNSGA2-PSA

Abstract EN

In general, the proximities to a certain diversity along the front and the Pareto front have the equal importance for solving multiobjective optimization problems (MOPs).

However, most of the existing evolutionary algorithms give priority to the proximity over the diversity.

To improve the diversity and decrease execution time of the nondominated sorting genetic algorithm II (NSGA-II), an improved algorithm is presented in this paper, which adopts a new vector ranking scheme to decrease the whole runtime and utilize Part and Select Algorithm (PSA) to maintain the diversity.

In this algorithm, a more efficient implementation of nondominated sorting, namely, dominance degree approach for nondominated sorting (DDA-NS), is presented.

Moreover, an improved diversity preservation mechanism is proposed to select a well-diversified set out of an arbitrary given set.

By embedding PSA and DDA-NS into NSGA-II, denoted as DNSGA2-PSA, the whole runtime of the algorithm is decreased significantly and the exploitation of diversity is enhanced.

The computational experiments show that the combination of both (DDA-NS, PSA) to NSGA-II is better than the isolated use cases, and DNSGA2-PSA still performs well in the high-dimensional cases.