A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions

• A new algorithm for optimization problems with three objective functions is presented which computes a representation for the set of nondominated points. This representation is guaranteed to have a desired coverage error and a bound on the number of iterations needed by the algorithm to meet this coverage error is derived. Since the representation does not necessarily contain nondominated points only, ideas to calculate bounds for the representation error are given. Moreover, the incorporation of domination during the algorithm and other quality measures are discussed.

Weitere Dienste

Verfasserangaben: Tobias Kuhn, Stefan Ruzika urn:nbn:de:hbz:386-kluedo-39116 Report in Wirtschaftsmathematik (WIMA Report) (152) Preprint Englisch 06.11.2014 2014 Technische Universität Kaiserslautern 07.11.2014 Approximation; Box-Algorithm; Multiobjective optimization; coverage error 16 Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vom 28.10.2014

$Rev: 13581$