Abstract: The disks packing problem, one of the NP hard problems, is of high theoretical and practical value To solve the disks packing problem that is encountered finding a good arrangement of multiple different sized disks in a larger rectangle and emerges in the field of transportation of freight, an effective algorithm is presented This algorithm divides all the disks into several groups according to given priorities, and then uses the quasi physical and quasi human algorithm to put these disks into the rectangle without overlapping During the packing procedure, the tabu search method is used to forbid the search doing repeated work and improve the performance of the search by helping the search escape from local minima The effectiveness of this algorithm is demonstrated through a number of typical computational experiments