3D Bin Packing Problem with Stackable Items (3DBPPsi) Benchmark Dataset

This dataset contains benchmark instances for the Three-Dimensional Bin Packing Problem with Stackable Items (3DBPPsi), a practical variant of the classical three-dimensional bin packing problem arising in transportation and logistics applications.The problem consists of packing a set of rectangular items into a heterogeneous fleet of vehicles while satisfying geometric, weight, density, orientation, and stacking constraints.

The objective is typically to minimize transportation costs by selecting and efficiently utilizing vehicles while ensuring that all items are feasibly loaded.The dataset includes:Vehicle dataEach vehicle type is characterized by:Internal length, width, and height.Maximum admissible payload.Maximum admissible weight that can be transferred through stacked items.Transportation cost.Maximum admissible loading density.Multiple heterogeneous vehicle types are available within each instance, allowing algorithms to jointly address loading and vehicle selection decisions.Item dataEach item is characterized by:Length, width, and height.Weight.Nesting height.Stackability class (items belonging to the same class may be stacked together).Forced orientation requirements.Maximum stackability level, defining the maximum number of items that can be placed within the same stack.Stacking constraintsUnlike traditional 3D bin packing benchmarks, the instances explicitly model stackable products.