A self-organizing decomposition based evolutionary algorithm with cooperative diversity measure for many-objective optimization

• Published in: AIMS mathematics Vol. 10; no. 6; pp. 13880 - 13907
• Main Authors: Zhao, Siyuan, Shao, Zichun, Chen, Yile, Zheng, Liang, Chen, Junming
• Format: Journal Article
• Language: English
• Published: AIMS Press 01.06.2025
• Subjects: cooperative diversity measure; evolutionary algorithm; many-objective optimization; self-organizing decomposition
• ISSN: 2473-6988; 2473-6988
• DOI: 10.3934/math.2025625

Decomposition based many-objective evolutionary algorithms have received wide attention over the years. However, most of them 1) are sensitive to the Pareto front shapes due to the dependence on the predefined reference vectors, and 2) only consider the global diversity but ignore the local diversity. These severely limit the using scope of decomposition based MaOEAs. Therefore, we propose a self-organizing decomposition based evolutionary algorithm with cooperative diversity measure (SDEA) for many-objective optimization in this work. In SDEA, a self-organizing decomposition manner is developed to automatically divide the objective space into different sub-regions instead of using the predefined reference vectors, which enables SDEA adapt to different Pareto front shapes. Such essence is that the self-organizing decomposition manner makes individuals with good diversity act as the reference vectors. Moreover, a cooperative diversity measure is designed to better promote the diversity, which takes the global diversity and local diversity into account. To validate the performance of SDEA, SDEA is compared with seven state-of-the-art methods on three benchmark test suites and two real-world applications. The corresponding results demonstrate that SDEA has higher competitiveness in dealing with different many-objective optimization problems.