One of the major distinguishing features of the Dynamic Multiobjective Optimization Problems (DMOPs) is that optimization objectives will change over time, thus tracking the varying Pareto-Optimal Front (POF) becomes a challenge. One of the promising solutions is reusing "experiences" to construct a prediction model via statistical machine learning approaches. However, most existing methods neglect the non-independent and identically distributed nature of data to construct the prediction model. In this paper, we propose an algorithmic framework, called Tr-DMOEA, which integrates transfer learning and population-based evolutionary algorithms (EAs) to solve the DMOPs. This approach exploits the transfer learning technique as a tool to generate an effective initial population pool via reusing past experience to speed up the evolutionary process, and at the same time any population based multiobjective algorithms can benefit from this integration without any extensive modifications. To verify this idea, we incorporate the proposed approach into the development of three well-known evolutionary algorithms, nondominated sorting genetic algorithm II (NSGA-II), multiojective particle swarm 1 arXiv:1612.06093v2 [cs.NE] 18 Nov 2017 optimization (MOPSO), and the regularity model-based multiobjective estimation of distribution algorithm (RM-MEDA). We employ twelve benchmark functions to test these algorithms as well as compare them with some chosen state-of-the-art designs. The experimental results confirm the effectiveness of the proposed design for DMOPs.