University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Objective reduction based on nonlinear correlation information entropy

Wang, H and Yao, X (2016) Objective reduction based on nonlinear correlation information entropy Soft Computing, 20 (6). pp. 2393-2407.

Full text not available from this repository.

Abstract

© 2015, Springer-Verlag Berlin Heidelberg.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.

Item Type: Article
Authors :
NameEmailORCID
Wang, Hhanding.wang@surrey.ac.ukUNSPECIFIED
Yao, XUNSPECIFIEDUNSPECIFIED
Date : 1 June 2016
Identification Number : 10.1007/s00500-015-1648-y
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:39
Last Modified : 17 May 2017 15:12
URI: http://epubs.surrey.ac.uk/id/eprint/839967

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800