A Method Based on Random Search Algorithm for Unequal Circle Packing Problem

We propose a random search algorithm to resolve the problem of packing circles into a rectangular container. With our method, all the circles are put into a large space randomly, and then by introducing the bow shift area, the searching space can be reduced and the local optimal solution can be list. By moving, turning and other disturbance methods, it will achieve the global optimization in the whole area. We designed exactly software to verify our algorithm. With our approach, the best optimal layout is irrelevant with the initial layout and the position of the biggest circle.