• search hit 3 of 3
Back to Result List

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.

Download full text files

Export metadata

Author:Tobias Kuhn, Stefan Ruzika
URN (permanent link):urn:nbn:de:hbz:386-kluedo-39116
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (152)
Document Type:Preprint
Language of publication:English
Publication Date:2014/11/06
Year of Publication:2014
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2014/11/07
Tag:Approximation; Box-Algorithm; Multiobjective optimization; coverage error
Number of page:16
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 28.10.2014