The two-dimensional cutting stock problem consists of cutting rectangular pieces from stock sheets (possibly with several different sizes and costs) in such a way the cost is minimized. In the multi-stage version of the problem, the process is divided into several stages (usually two or three), and in each stage we are only allowed to perform either horizontal or vertical guillotine cuts. In the first stage we are only allowed to perform horizontal cuts, in the second stage we are only allowed to perform vertical cuts, and so on. Item rotation may or may not be allowed. Exact final cut of pieces may or may not be required at the last stage.
The MIP models are being solved using COIN-OR CBC (an open-source MIP solver). 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]