Abstract: This paper studies the problem of how to maximize the inner space usage when goods with the same dimension are packed into a container.Firstly,the orientations of the container and the goods and the residual space are fully taken into consideration,and a heuristic algorithm is used.Secondly,a packing tree is created by filling the main space,dividing the spaces and optimizing the residual space.Finally,Java is used to realize the packing tree algorithm and to solve the container loading problem.Example shows that the algorithm is applicable and effective.