Abstract
In this paper we develop a framework for the approximation of the entire set of ε-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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Schütze, O., Coello Coello, C. A., & Talbi, E. G. (2007). Approximating the ε-efficient set of an MOP with stochastic search algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4827 LNAI, pp. 128–138). Springer Verlag. https://doi.org/10.1007/978-3-540-76631-5_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
