A new algorithm for the Bin-packing problem with fragile objects

Given a set of items, the Bin-Packing problem is to find the smallest number of boxes called “bins” for an optimal packing of items. In this paper, we discuss a special case of Bin-Packing, when the objects have size and fragility. We cite the frequency allocation problem as analogous problem of Bin-packing with fragile objects. Thus, we develop a new strategy adapted to this case, and we compare it to other strategy of classical Bin-Packing.