  This paper deals with the problem of circle packing, in which the largest
radii circle is to be fit in a confined space filled with arbitrary circles of
different radii and centers. A circle packing problem is one of a variety of
cutting and packing problems. We suggest four different nature-inspired
Meta-heuristic algorithms to solve this problem. Algorithms are based on the
social behavior of other biology species such as birds, wolves, fireflies, and
bats. Moreover, recent advancements in these algorithms are also considered for
problem-solving. The circle packing problem is one of the NP-hard problems. It
is challenging to solve NP-hard problems exactly, so the proposed algorithms
provide an approximate solution within the allotted time. Standard statistical
parameters are used for comparison, and simulation and results indicate that
the problem is highly non-linear and sensitive.
