# Fast Neighborhood Search Heuristics for the Colored Bin Packing Problem

arXiv: https://arxiv.org/abs/2310.04471 · HTML: https://mlsanity.com/paper/2310.04471/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 41 references that are in the map.
- First posted on arXiv 6 Oct 2023.

## Builds on (most cited first, 5 of 5)

- [Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression](https://mlsanity.com/paper/1310.6887/) (2013)
- [Colorful bin packing](https://mlsanity.com/paper/1404.3990/) (2014)
- [Online Colored Bin Packing](https://mlsanity.com/paper/1404.5548/) (2014)
- [Exact solution of network flow models with strong relaxations](https://mlsanity.com/paper/2105.14961/) (2021)
- [Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem](https://mlsanity.com/paper/2305.15291/) (2023)

## Abstract (arXiv)

The Colored Bin Packing Problem (CBPP) is a generalization of the Bin Packing Problem (BPP). The CBPP consists of packing a set of items, each with a weight and a color, in bins of limited capacity, minimizing the number of used bins and satisfying the constraint that two items of the same color cannot be packed side by side in the same bin. In this article, we proposed an adaptation of BPP heuristics and new heuristics for the CBPP. Moreover, we propose a set of fast neighborhood search algorithms for CBPP. These neighborhoods are applied in a meta-heuristic approach based on the Variable Neighborhood Search (VNS) and a matheuristic approach that combines linear programming with the meta-heuristics VNS and Greedy Randomized Adaptive Search (GRASP). The results indicate that our matheuristic is superior to VNS and that both approaches can find near-optimal solutions for a large number of instances, even for those with many items.