DeepAI AI Chat
Log In Sign Up

Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation

by   David Bergman, et al.

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 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.


page 1

page 2

page 3

page 4


Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...

An APTAS for Bin Packing with Clique-graph Conflicts

We study the following variant of the classic bin packing problem. The i...

Trolley optimisation: An extension of bin packing to load PCB components

A trolley is a container for loading printed circuit board (PCB) compone...

Packing of mixed hyperarborescences with flexible roots via matroid intersection

Given a mixed hypergraph ℱ=(V,𝒜∪ℰ), functions f,g:V→ℤ_+ and an integer k...

Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem

In this paper, we will shed light on when to pack and use 3D-printers in...

A space-indexed formulation of packing boxes into a larger box

Current integer programming solvers fail to decide whether 12 unit cubes...

A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem

The Two-dimensional Bin Packing Problem calls for packing a set of recta...