论文部分内容阅读
采用循环拥挤排序策略,形成改进的NSGA-Ⅱ算法.循环拥挤排序策略首先计算同一级非支配解的拥挤距离,删除其中拥挤距离最小的解;然后重新计算剩余解之间的拥挤距离,再次删除其中拥挤距离最小的解.以次类推,直到选出指定数量支配解为止.与单次拥挤距离排序相比,循环拥挤距离排序得到的解具有更好的多样性.ZDT1～ZDT4四个基准函数测试结果表明,改进的NSGA-Ⅱ比NSGA-Ⅱ具有更好的收敛性和多样性.
A cyclic congestion ordering algorithm is adopted to form an improved NSGA-Ⅱ algorithm. The cyclic congestion ordering strategy first computes the crowding distance of the same degree of nondominated solution and removes the solution with the smallest crowding distance. Then recalculates the crowding distance between the remaining solutions and deletes again Where the crowded distance is the smallest solution, and so on, until the specified number of dominating solutions is selected.Compared with the one-crowded distance ranking, the solutions obtained by the cyclic crowding distance ranking are more diversified.ZDT1 ~ ZDT4 four benchmark functions The test results show that the improved NSGA-Ⅱ has better convergence and diversity than NSGA-Ⅱ.