A dichotomous search-based heuristic for the three-dimensional sphere packing problem
In this paper, the three-dimensional sphere packing problem is solved by using a dichotomous search-based heuristic.An instance of the problem is defined by a set of $ n $ unequal spheres and an object of fixed width and height and, unlimited length.Each sphere is characterized by its radius Utensil Set and the aim of the problem is to optimize the