Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes

Recently, a number of high performance many-objective evolutionary algorithms with systematically generated weight vectors have been proposed in the literature. Those algorithms often show surprisingly good performance on widely used DTLZ and WFG test problems. The performance of those algorithms ha...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on evolutionary computation Jg. 21; H. 2; S. 169 - 190
Hauptverfasser:	Ishibuchi, Hisao, Setoguchi, Yu, Masuda, Hiroyuki, Nojima, Yusuke
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.04.2017
Schlagworte:	Convergence Decomposition-based evolutionary algorithms Evolutionary computation Maintenance engineering many-objective evolutionary algorithms many-objective optimization many-objective test problems Optimization Performance evaluation Search problems Shape
ISSN:	1089-778X, 1941-0026
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!