Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of the Bin Packing Problem in which each item has a size and a color and the goal is to minimize the sum of the number of bins containing items of each color. In this work, we introduce the�BPMCF and present a decomposition strategy to solve the problem, where the assignment of items to bins is formulated as a binary decision diagram and an optimal integrated solutions is identified through a mixed-integer linear programming model. Our computational experiments show that the proposed approach greatly outperforms a direct formulation of BPMCF and that its performance is suitable for large instances of the problem.

Cite

CITATION STYLE

APA

Bergman, D., Cardonha, C., & Mehrani, S. (2019). Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11494 LNCS, pp. 57–66). Springer Verlag. https://doi.org/10.1007/978-3-030-19212-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free