摘要
Balancing the convergence and diversity of many-objective evolutionary algorithms is difficult and challenging. In this work, a multi-search strategy based on decomposition is proposed to generate good offspring and improve convergence, and an external population strategy is used to maintain the diversity of the obtained solutions. The multi-search strategy allows the selection of sparse and convergent nondominated solutions to carry out the exploration and exploitation steps. Experiments are conducted on 15 benchmark functions from the CEC 2018 with 5, 10, and 15 objectives. The results indicate that the proposed algorithm can obtain a set of solutions with better diversity and convergence than the five efficient state-of-the-art algorithms, i.e. NSGAIII, MOEA/D, MOEA/DD, KnEA, and RVEA.
学科与关键词
- A Survey on Search Strategy of Evolutionary Multi-Objective Optimization AlgorithmsWang, Zitong; Pei, Yan*; Li, JianqiangApplied Sciences-Basel, 2023, 13(7): 4643.被引 19
- An improved many-objective meta-heuristic adaptive decomposition algorithm based on mutation individual position detectionZhang, Jinlu; Wei, Lixin*; Guo, Zeyin; Hu, Ziyu; Che, HaijunInternational Journal of Machine Learning and Cybernetics, 2024, 15(12): 5981-6010.
- Subspace segmentation based co-evolutionary algorithm for balancing convergence and diversity in many-objective optimizationLiu, Genggeng; Pei, Zhenyu; Liu, Nengxian; Tian, Ye*Swarm and Evolutionary Computation, 2023, 83: 101410.被引 9
