基于分解和支配关系的超多目标进化算法

Decomposition and Dominance Relation Based Many-objective Evolutionary Algorithm

近年来,超多目标优化问题(MaOPs)成为了进化计算领域的研究热点。然而,在处理各种优化问题中,如何有效地平衡收敛性和多样性仍是一个难题。为了解决上述的问题,该文提出了一种基于分解和支配关系的超多目标进化算法(DdrEA)。首先利用权重向量把整个种群分解为一组子种群,这些子种群将进行协同优化;然后利用角度和角度支配关系计算子种群内每个解的值;最后根据适应度值进行精英选择,即在每个子空间内选取适应度值最小的解作为精英解进入下一代。DdrEA通过与当前较优的NSGA-Ⅱ/AD, RVEA, MOMBI-Ⅱ等多个超多目标进化算法进行实验对比,实验结果表明该文算法性能明显优于对比算法,能够有效平衡种群的收敛性和多样性。

In recent year,the Many-objective Optimization Problems(MaOPs)have become an increasingly hot research area in evolutionary computation.However,it is still a difficult problem to achieve a good balance between convergence and diversity on solving various kinds of MaOPs.To alleviate this issue mentioned above,a Decomposition and dominance relation based many-objective Evolutionary Algorithm(DdrEA)is proposed in this paper.Firstly,the population is decomposed into numbers of sub-populations by using a set of uniform weight vectors,in which they are optimized in a cooperative manner.Then,the fitness value of solution in each sub-population is calculated by angle dominance relation and angle.Finally,elite selection strategy is performed according to its corresponding fitness value.That is,in each subspace,the solution with the smallest fitness value is selected as the elite solution to enter the next generation.Comparing with several high-dimensional and multi-objective evolutionary algorithms(NSGA-II/AD,RVEA,MOMBI-II),the experimental results show that the performance of the proposed algorithm DdrEA is better than that of the comparison algorithm,and the convergence and diversity of the population can be effectively balanced.