# Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP

1 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Recently, a framework for the approximation of the entire set of $\epsilon$-efficient solutions (denote by $E_\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such an algorithm produces -- under mild assumptions on the process to generate new candidate solutions --a sequence of archives which converges to $E_{\epsilon}$ in the limit and in the probabilistic sense. The result, though satisfactory for most discrete MOPs, is at least from the practical viewpoint not sufficient for continuous models: in this case, the set of approximate solutions typically forms an $n$-dimensional object, where $n$ denotes the dimension of the parameter space, and thus, it may come to perfomance problems since in practise one has to cope with a finite archive.\\ Here we focus on obtaining finite and tight approximations of $E_\epsilon$, the latter measured by the Hausdorff distance. We propose and investigate a novel archiving strategy theoretically and empirically. For this, we analyze the convergence behavior of the algorithm, yielding bounds on the obtained approximation quality as well as on the cardinality of the resulting approximation, and present some numerical results.
Keywords :
Document type :
Reports
Complete list of metadatas

Cited literature [19 references]

https://hal.inria.fr/inria-00269410
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, April 4, 2008 - 10:16:33 AM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Tuesday, September 21, 2010 - 3:59:56 PM

### Files

RR-6492.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00269410, version 2
• ARXIV : 0804.0581

### Citation

Oliver Schuetze, Carlos A. Coello Coello, Emilia Tantar, El-Ghazali Talbi. Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP. [Research Report] RR-6492, INRIA. 2008. ⟨inria-00269410v2⟩

Record views