Computer Science – Numerical Analysis
Scientific paper
2008-04-03
Computer Science
Numerical Analysis
Scientific paper
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.
Coello Coello Carlos A.
Schuetze Oliver
Talbi El-Ghazali
Tantar Emilia
No associations
LandOfFree
Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-352859