A New Algorithm for Packing Unequal Disks in a Larger Circle

摘要

To set unequal disks in a container as small as possible without overlap is a fairly fascinating NPhard task with wide applications. In this paper,we introduced a new method using the techniques of Tabu search,quasi-human basin-hopping strategy,and BFGS method as its basic elements,and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.