A Decomposition-Based Evolutionary Algorithm with Neighborhood Region Domination

The decomposition-based multi-objective optimization algorithm MOEA/D (multi-objective evolutionary algorithm based on decomposition) introduces the concept of neighborhood, where each sub-problem requires optimization through solutions within its neighborhood. Due to the comparison being only with solutions in the neighborhood, the obtained set of solutions is not sufficiently diverse, leading to poorer convergence properties. In order to adequately acquire a high-quality set of solutions, this algorithm requires a large number of population iterations, which in turn results in relatively low computational efficiency. To address this issue, this paper proposes an algorithm termed MOEA/D-NRD, which is based on neighborhood region domination in the MOEA/D framework. In the improved algorithm, domination relationships are determined by comparing offspring solutions against neighborhood ideal points and neighborhood worst points. By selecting appropriate solution sets within these comparison regions, the solution sets can approach the ideal points more and faster, thereby accelerating population convergence and enhancing the computational efficiency of the algorithm.