New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation
- 31 Downloads
In the Bin Packing Problem with Item Fragmentation a set of items of known weight and a set of bins of limited capacity are given; the task is to find the minimum cost assignment of items to bins without exceeding their capacity. However, contrary to the classical Bin Packing Problem, items can be split and fractionally assigned to different bins at a cost. In this paper we generalize models and properties from the literature by considering a set of heterogeneous bins, possibly having different cost and capacity. We prove that such a natural extension changes substantial features of the problem. We propose both compact and extended formulations and a branch-and-price algorithm that combines column generation techniques and implicit enumeration strategies to achieve guarantees on the optimality of the solutions. We present the results of an extensive experimental campaign proving that our algorithm outperforms general purpose commercial solvers by orders of magnitude.
KeywordsBin Packing Item Fragmentation Variable Cost and Size Column generation
Project partially funded by Regione Lombardia, POR FESR 2014-2020 project AD-COM.
- 6.CPLEX Development Team: Ibm ilog cplex optimization studio: Cplex user’s manual - version 12 release 6. Tech. rep, IBM corp (2014)Google Scholar
- 13.Naaman, N., Rom, R.: Packet scheduling with fragmentation. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 427–436 vol. 1 (2002)Google Scholar
- 14.Secci, S., Ceselli, A., Malucelli, F., Pattavina, A., Sansò, B.: Direct optimal design of a quasi-regular composite-star core network. In: IEEE Proceedings of DRCN, pp. 7–10 (2007)Google Scholar