Full metadata record
|dc.description.abstract||Research within the area of Evolutionary Multi-objective Optimization (EMO) focused on two- and three-dimensional objective functions, so far. Most algorithms have been developed for and tested on this limited application area. To broaden the insight in the behavior of EMO algorithms (EMOA) in higher dimensional objective spaces, a comprehensive benchmarking is presented, featuring several state-ofthe-art EMOA, as well as an aggregative approach and a restart strategy on established scalable test problems with three to six objectives. It is demonstrated why the performance of well-established EMOA (NSGAII, SPEA2) rapidly degradates with increasing dimension. Newer EMOA like e-MOEA, MSOPS, IBEA and SMS-EMOA cope very well with highdimensional objective spaces. Their specific advantages and drawbacks are illustrated, thus giving valuable hints for practitioners which EMOA to choose depending on the optimization scenario. Additionally, a new method for the generation of weight vectors usable in aggregation methods is presented.||en|
|dc.relation.ispartofseries||Reihe CI; 217-06||de|
|dc.title||Pareto-, aggregation-, and indicator-based methods in many-objective optimization||en|
|Appears in Collections:||Sonderforschungsbereich (SFB) 531|
This item is protected by original copyright
Items in Eldorado are protected by copyright, with all rights reserved, unless otherwise indicated.