An Angle-Based Bi-Objective Evolutionary Algorithm for Many-Objective Optimization

IEEE Access

卷:8

Jun-Feng Qu¹  Jiaxing Zhang²  Feng Yang²  Shenwen Wang²  Na Gao² 

[1] School of Computer Engineering, Hubei University of Arts and Science, Xiangyang, China;

[2] School of Information Engineering, Hebei GEO University, Shijiazhuang, China;

关键词: Many-objective optimization;    evolutionary algorithm;    convergence;    diversity;    bi-objective;   

DOI  :  10.1109/ACCESS.2020.3032681

来源: DOAJ

【 摘 要 】

One of the main difficulties in solving many-objective optimization is the lack of selection pressure. For an optimization problem, its main purpose is to obtain a nondominated solution set with better convergence and diversity. In this paper, two estimation methods are proposed to convert a many-objective optimization problem into a simple bi-objective optimization problem, that is, the convergence and diversity estimation methods, so as to greatly improve the probability of certain dominance relation between solutions, and then increase the selection pressure. Based on the proposed estimation methods, a new many-objective evolutionary algorithm, termed ABOEA, is proposed. In the convergence estimation method, we use a modified ASF function to solve the performance degradation of the traditional norm distance on the irregular Pareto front. In the diversity estimation method, we innovatively propose a diversity estimation method based on the angle between solutions. Empirical experimental results demonstrate that the proposed algorithm shows its competitiveness against the state-of-art algorithms in solving many-objective optimization problems. Two estimation methods proposed in this paper can greatly improve the performance of algorithms in solving many-objective optimization problems.

【 授权许可】

Unknown