Menu
The two-dimensional bin packing problem (2D-BPP) consists of packing without overlap, a set I of two-dimensional rectangular items into the minimum number of two-dimensional rectangular bins [1–3]. All the bins are identical with width W and height H, and each item i ∈ I has a specific width wi and height hi.
The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of a fixed given capacity, in a way that minimizes the number of bins used.
The bin-packing problem is one of the most investigated and applicable models in combinatorial optimization. The problem consists of packing objects of different sizes into a finite number of similar bins/containers, in a way that the number of used bins is minimized.
The 3D Bin Packing Problem (3D-BPP) is one of the most frequent problems in warehousing and logistics. Its solution is filling a container (a box or pallet) with items as closely to each other as possible to minimize the number of required containers.
As the title already says I need C/C++ sourcecode or a library that I can use to solve the Bin Packing problem with 2D rectangular shapes where the bin is also rectangular and the rectangles are also being rotated by 90° angles to fit better. I already have all required values, so I need no online packing algorithm.
I only found a lib that deals with a square bin and without rotation which is not really efficient enough for my needs.
I would really appreciate anything C/C++ handling a rectangular bin and rotation.
Thanks.
PS: The required time for the calculation is not important, only the result is.
PPS: It has to be C or C++, and I didn't find anything useful searching stackoverflow...
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With