Decomposition-based algorithms seem promising for many-objective optimization problems. However, the issue of selecting a set of weighting vectors for more than two objectives is still unresolved and
methods are predominantly used. In the present work, a novel concept is introduced which we call generalized decomposition. Generalized decomposition enables the analyst to adapt the generated distribution of Pareto optimal points, according to the preferences of the decision maker. Also it is shown that generalized decomposition unifies the three performance objectives in multi-objective optimization algorithms to only one, that of convergence to the Pareto front.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten