Solving a multi-objective optimization problem results in a Pareto front approximation, and it differs from single-objective optimization, requiring specific search strategies. These strategies, mostly fitness assignment, are designed to find a set of non-dominated solutions, but different approaches use various schemes to achieve this goal. In many cases, cooperative algorithms such as island model-based algorithms outperform each particular algorithm included in this cooperation. However, we should note that there are some control parameters of the islands' interaction and, in this paper, we investigate how they affect the performance of the cooperative algorithm. We consider the influence of a migration set size and its interval, the number of islands and two types of cooperation: homogeneous or heterogeneous. In this study, we use the real-valued evolutionary algorithms SPEA2, NSGA-II, and PICEA-g as islands in the cooperation. The performance of the presented algorithms is compared with the performance of other approaches on a set of benchmark multi-objective optimization problems.