Computing the Set of Approximate Solutions of an MOP with Stochastic Search Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Other Publications Year : 2007

Computing the Set of Approximate Solutions of an MOP with Stochastic Search Algorithms

Abstract

In this work we develop a framework for the approximation of the entire set of $\epsilon$-efficient solutions of a multi-objective optimization problem with stochastic search algorithms. For this, we propose the set of interest, investigate its topology and state a convergence result for a generic stochastic search algorithm toward this set of interest. Finally, we present some numerical results indicating the practicability of the novel approach.
Fichier principal
Vignette du fichier
conv_epseff_rr.pdf (3.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00157741 , version 1 (27-06-2007)
inria-00157741 , version 2 (23-10-2007)

Identifiers

  • HAL Id : inria-00157741 , version 2

Cite

Oliver Schuetze, Carlos A. Coello Coello, El-Ghazali Talbi. Computing the Set of Approximate Solutions of an MOP with Stochastic Search Algorithms. 2007. ⟨inria-00157741v2⟩
157 View
113 Download

Share

Gmail Facebook X LinkedIn More