Bin Packing Problems with Item Fragmentation (BPPIF) are variants of classical Bin Packing in which items can be split at a price. We extend BPPIF models from the literature by allowing a set of heterogeneous bins, each potentially having a different cost and capacity. We introduce extended formulations and column generation algorithms to obtain good bounds with reasonable computing effort. We test our algorithms on instances from the literature. Our experiments prove our approach to be more effective than state-of-the-art general purpose solvers.
Column generation for the variable cost and size bin packing problem with fragmentation / M. Casazza, A. Ceselli. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 55:(2016), pp. 61-64. ((Intervento presentato al 14. convegno CTW tenutosi a Gargnano nel 2016 [10.1016/j.endm.2016.10.016].
Column generation for the variable cost and size bin packing problem with fragmentation
M. Casazza;A. Ceselli
2016
Abstract
Bin Packing Problems with Item Fragmentation (BPPIF) are variants of classical Bin Packing in which items can be split at a price. We extend BPPIF models from the literature by allowing a set of heterogeneous bins, each potentially having a different cost and capacity. We introduce extended formulations and column generation algorithms to obtain good bounds with reasonable computing effort. We test our algorithms on instances from the literature. Our experiments prove our approach to be more effective than state-of-the-art general purpose solvers.File | Dimensione | Formato | |
---|---|---|---|
2016_ENDM_Casazza_Ceselli_VSCBPPF.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
166.07 kB
Formato
Adobe PDF
|
166.07 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.