Objective reduction based on nonlinear correlation information entropy

Handing Wang

doi:10.1007/s00500-015-1648-y

Return

Objective reduction based on nonlinear correlation information entropy

2015-03-17

Handing Wang *

Xin Yao

DOI：10.1007/s00500-015-1648-y

Original

Save

View PDF

Abstract

En 中文

It is hard to obtain the entire solution set of a many-objective optimization problem (MaOP) by multi-objective evolutionary algorithms (MOEAs) because of the difficulties brought by the large number of objectives. However, the redundancy of objectives exists in some problems with correlated objectives (linearly or nonlinearly). Objective reduction can be used to decrease the difficulties of some MaOPs. In this paper, we propose a novel objective reduction approach based on nonlinear correlation information entropy (NCIE). It uses the NCIE matrix to measure the linear and nonlinear correlation between objectives and a simple method to select the most conflicting objectives during the execution of MOEAs. We embed our approach into both Pareto-based and indicator-based MOEAs to analyze the impact of our reduction method on the performance of these algorithms. The results show that our approach significantly improves the performance of Pareto-based MOEAs on both reducible and irreducible MaOPs, but does not much help the performance of indicator-based MOEAs.

Keywords:

Multi-objective optimization

Objective reduction

Nonlinear correlation information entropy

Multi-objective evolutionary algorithm

Dimension reduction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.