Hanne, T.T.Hanne2022-03-032022-03-032007https://publica.fraunhofer.de/handle/publica/21310910.1016/j.ejor.2005.05.0312-s2.0-33749999183In this article, a new framework for evolutionary algorithms for approximating the efficient set of a multiobjective optimization (MOO) problem with continuous variables is presented. The algorithm is based on populations of variable size and exploits new elite preserving rules for selecting alternatives generated by mutation and recombination. Together with additional assumptions on the considered MOO problem and further specifications on the algorithm, theoretical results on the approximation quality such as convergence in probability and almost sure convergence are derived.en519003006300journal article