Abstract: Packing problems which belong to NP-complete problems have been studied for many years. As a kind of new heuristic optimization method, simulated annealing algorithm has been applied to some combintorial optimization problems such as VLSI design and image processing. According to the analysis on packing problems and simulated annealing algorithm, this paper presents a simulated annealing packing algorithm which can be used to solve packing problems. The calculating results show the algorithm can obtain a better solution which cann′t be gotten by traditional optimizatoin algorithm. The paper also discusses some parameter′s roles in the algorithm by several examples.