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.

Exact Algorithms for the Bin Packing Problem with Fragile Objects / M. A., Alba Martìnez; F., Clautiaux; Dell'Amico, Mauro; Iori, Manuel. - In: DISCRETE OPTIMIZATION. - ISSN 1572-5286. - STAMPA. - 10:3(2013), pp. 210-223. [10.1016/j.disopt.2013.06.001]

Exact Algorithms for the Bin Packing Problem with Fragile Objects

DELL'AMICO, Mauro;IORI, MANUEL
2013

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.
10
3
210
223
Exact Algorithms for the Bin Packing Problem with Fragile Objects / M. A., Alba Martìnez; F., Clautiaux; Dell'Amico, Mauro; Iori, Manuel. - In: DISCRETE OPTIMIZATION. - ISSN 1572-5286. - STAMPA. - 10:3(2013), pp. 210-223. [10.1016/j.disopt.2013.06.001]
M. A., Alba Martìnez; F., Clautiaux; Dell'Amico, Mauro; Iori, Manuel
File in questo prodotto:
File Dimensione Formato  
AlbaMartinez-et-al-DISOPT-2013.pdf

non disponibili

Descrizione: Articolo principale
Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 644.16 kB
Formato Adobe PDF
644.16 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/963899
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 4
social impact