# Benchmark dataset and instance generator for Real-World Three-Dimensional Bin Packing Problems

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 8 references that are in the map.
- First posted on arXiv 28 Apr 2023.

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

- [Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers](https://mlsanity.com/paper/2303.01977/) (2023)

## Built on by (most cited first, 1 of 1)

- [Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approach](https://mlsanity.com/paper/2308.02787/) (2023)

## Abstract (arXiv)

In this article, a benchmark for real-world bin packing problems is proposed. This dataset consists of 12 instances of varying levels of complexity regarding size (with the number of packages ranging from 38 to 53) and user-defined requirements. In fact, several real-world-oriented restrictions were taken into account to build these instances: i) item and bin dimensions, ii) weight restrictions, iii) affinities among package categories iv) preferences for package ordering and v) load balancing. Besides the data, we also offer an own developed Python script for the dataset generation, coined Q4RealBPP-DataGen. The benchmark was initially proposed to evaluate the performance of quantum solvers. Therefore, the characteristics of this set of instances were designed according to the current limitations of quantum devices. Additionally, the dataset generator is included to allow the construction of general-purpose benchmarks. The data introduced in this article provides a baseline that will encourage quantum computing researchers to work on real-world bin packing problems.