Exact algorithms for the bin packing problem with fragile objects

Abstract : We are given a set of objects, each characterized by a weight and a fragility, and a large number of uncapacitated bins. Our aim is to find the minimum number of bins needed to pack all objects, in such a way that in each bin the sum of the object weights is less than or equal to the smallest fragility of an object in the bin. The problem is known in the literature as the Bin Packing Problem with Fragile Objects, and appears in the telecommunication field, when one has to assign cellular calls to available channels by ensuring that the total noise in a channel does not exceed the noise acceptance limit of a call. We propose a branch-and-bound and several branch-and-price algorithms for the exact solution of the problem, and improve their performance by the use of lower bounds and tailored optimization techniques. In addition we also develop algorithms for the optimal solution of the related knapsack problem with fragile objects. We conduct an extensive computational evaluation on the benchmark set of instances, and show that the proposed algorithms perform very well.
Document type :
Journal articles
Complete list of metadatas

Contributor : François Clautiaux <>
Submitted on : Tuesday, November 26, 2013 - 12:05:44 PM
Last modification on : Thursday, May 16, 2019 - 3:54:05 PM

Links full text



Manuel Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori. Exact algorithms for the bin packing problem with fragile objects. Discrete Optimization, Elsevier, 2013, 10 (3), pp.210-223. ⟨10.1016/j.disopt.2013.06.001⟩. ⟨hal-00909480⟩



Record views