In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well as empirical results lead to the development of a new recombination operator, which improves the approximation of the set of efficient solutions significantly. Furtheron, it is shown that applying speciation to the analysed model makes it possible to handle even more complex problems. Categories and Subject Descriptors F.2.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity--Nonnumerical Algorithms and Problems General Terms Experimentation, Algorithm, Theory Keywords predator-prey, variation operators, simplex-recombination, multi-objective optimization