For many-objective optimization problems (MaOPs), the problem of balancing the convergence and the diversity during the search process is often encountered but very challenging due to its vast range of searching objective space. To solve the above problem, we propose a novel many-objective evolutionary algorithm based on the hybrid angle-encouragement decomposition (MOEA/AD-EBI). The proposed MOEA/AD-EBI combines two types of decomposition approaches, i.e., the angle-based decomposition and the encouragement-based boundary intersection decomposition. By coordinating the above two decomposition approaches, MOEA/AD-EBI is expected to effectively achieve a good balance between the convergence and the diversity when solving various kinds of MaOPs. Extensive experiments on some well-known benchmark problems validate the superiority of MOEA/AD-EBI over some state-of-the-art many-objective evolutionary algorithms.
CITATION STYLE
Su, Y., Wang, J., Ma, L., Wang, X., Lin, Q., & Chen, J. (2018). A Novel Many-Objective Optimization Algorithm Based on the Hybrid Angle-Encouragement Decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10956 LNAI, pp. 47–53). Springer Verlag. https://doi.org/10.1007/978-3-319-95957-3_6
Mendeley helps you to discover research relevant for your work.