8481 articles  [version française]

inria-00269410, version 2

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

Oliver Schuetze 1, Carlos A. Coello Coello 2, Emilia Tantar 2, El-Ghazali Talbi 1345

N° RR-6492 (2008)

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.

• 1:  DOLPHIN (INRIA Futurs)
• INRIA – CNRS : UMR8022 – Université Lille I - Sciences et technologies
• 2:  DOLPHIN (INRIA Lille - Nord Europe)
• INRIA – CNRS : UMR8022 – Université Lille I - Sciences et technologies
• 3:  Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA)
• Institut National Polytechnique de Grenoble (INPG)
• 4:  Laboratoire de Génie Informatique (LGI - IMAG)
• IMAG – Université Joseph Fourier - Grenoble I
• 5:  Laboratoire d'Informatique Fondamentale de Lille (LIFL)
• CNRS : UMR8022 – Université Lille I - Sciences et technologies – Université Lille III - Sciences humaines et sociales – INRIA
• Domain : Computer Science/Numerical Analysis
• Keywords : multi-objective optimization – convergence – epsilon-efficient solutions – approximate solutions – stochastic search algorithms
• Internal note : RR-6492
• Available versions :  v1 (2008-04-03) v2 (2008-04-04)

• inria-00269410, version 2
• oai:hal.inria.fr:inria-00269410
• From:
• Submitted on: Friday, 4 April 2008 10:16:33
• Updated on: Tuesday, 21 October 2008 16:58:13