基于L1/2范数拥挤度度量的多模态多目标优化算法

Multi⁃modal multi⁃objective optimization algorithm based on L1/2⁃norm crowding measurement

  • 摘要: 为得到均匀性、多样性、收敛性更好的Pareto前沿及多样性较好的Pareto解集,提出了一种基于L1/2范数的解空间和目标空间拥挤度度量方法。基于K⁃Means算法对解进行聚类,设计了非支配解的分解和合并策略,以得到更均匀Pareto前沿及多样化的Pareto解集。为验证算法的高效性,在CEC’2019标准函数中将改进的算法与5种基准测试算法进行对比,结果表明:改进的算法能够得到较优的rPSP、rHV、IGDX、IGDF度量指标。

     

    Abstract: To obtain more uniformly, convergence distributed of Pareto Front (PF) and the diversity of Pareto Sets (PSs), a crowding measurement strategy based on L1/2 in the solution space and objective space was proposed. A non‑dominated solution decomposition and merging strategy, which clusters the solutions by using K⁃means, was designed to obtain uniformly PF and diversity PSs. For the sake of demonstrating the performance of the proposed algorithm, the experiments have been conducted on the CEC’2019 benchmark functions with five compared algorithms. Experimental results showed that the proposed algorithm could obtain a better metric value on rPSP, rHV, IGDX, IGDF.

     

/

返回文章
返回