The p-dimensional vector bin packing problem, also called general assignment problem, is a generalization of bin packing with multiple constraints. In this problem, we are required to pack n items of m different types, represented by p-dimensional vectors, into as few bins as possible. By means of reductions to vector packing, several cutting & packing problems, including the one-dimensional bin packing and cutting stock problems, can be solved.
The MIP models are being solved using COIN-OR CBC (an open-source MIP solver) on a Raspberry Pi 3 Model B. Much better run times can be achieved using Gurobi or CPLEX.
By means of reductions to vector packing, VPSolver can be used to solve several problems such as:
By means of reductions to multiple-choice vector packing, VPSolver can be used to solve several problems such as:
VPSolver includes a python interface that allows modeling other problems easily. Using the python interface, VPSolver can be used to solve problems such as:
Note: Suggestions of other cutting & packing problems (including industrial applications) are welcome! [Contact]