Abstract: Investigating on the packing heuristic algorithms, this paper puts forward the concept of dynamic attractive factors. Based on the dynamic attractive factors, a dynamic placement function and an algorithm for the packing problem are built. The signification of the parameters and coordinate in the placement function is analyzed. Different optimal packing schemes that satisfy different conditions and demands can be obtained by adjusting the values of the parameters in the placement function. Finally, some examples validate the rationality of this algorithm.