This repository contains various benchmark instances for the Vector Bin Packing and one-dimensional Bin Packing problems.

Multi-dimensional instances

The multi_dimensions folder contains instances for the Vector Bin Packing problem.

This folder currently contains the 3 benchmarks (Panigrahy, Triplet and New) used for the experimental part of the paper "Classification and evaluation of the algorithms for vector bin packing", published in Computers and Operations Research journal and openly available on HAL.

Folder content

• Instance files: all instance files used in the paper, archived in tar gz format. Instance files follow the VBP format introduced for the VPSolver by F. Brandão (see manual here).
• Generation scipts: the Python used to generate the instance files, with the process defined in the paper referenced above.
• Optimal solutions: the OPT_solutions_Panigrahy and OPT_solutions_New files contain for each instance the value of a simple lower bound and the value of the optimal solution, and -1 if the optimal is unknown. The optimal solution of the Triplet instances is by definition the number of items in an instance divided by 3.

If you need to refer to these multi-dimensional benchmarks, please cite our paper: Clément Mommessin, Thomas Erlebach, and Natalia Shakhlevich. "Classification and evaluation of the algorithms for vector bin packing". In Computers and Operations Research, 173, 2025.