Department of Computer Science
Online objective reduction for many-objective optimization problems
© 2014 IEEE.For many-objective optimization problems, i.e. the number of objectives is greater than three, the performance of most of the existing Evolutionary Multi-objective Optimization algorithms will deteriorate to a certain degree. It is therefore desirable to reduce many objectives to fewer essential objectives, if applicable. Currently, most of the existing objective reduction methods are based on objective selection, whose computational process is, however, laborious. In this paper, we will propose an online objective reduction method based on objective extraction for the many-objective optimization problems. It formulates the essential objective as a linear combination of the original objectives with the combination weights determined based on the correlations of each pair of the essential objectives. Subsequently, we will integrate it into NSGA-II. Numerical studies have show the efficacy of the proposed approach.
Source Publication Title
2014 IEEE Congress on Evolutionary Computation (CEC)
Link to Publisher's Edition
Cheung, Yiu-Ming, and Fangqing Gu. "Online objective reduction for many-objective optimization problems." 2014 IEEE Congress on Evolutionary Computation (CEC) (2014): 1165-1171.