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...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on evolutionary computation Ročník 21; číslo 2; s. 169 - 190
Hlavní autoři:	Ishibuchi, Hisao, Setoguchi, Yu, Masuda, Hiroyuki, Nojima, Yusuke
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.04.2017
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!