3D Bin Packing problem with items distribution evenly constraints
I have a struggle with 3d bin packing problem that :
How to get from State A to State B in a bin-packing problem?
Let’s say that we have a multi-dimensional bin packing problem. In the initial state, the items are assigned using an algorithm that randomly puts an item to a bin, so there are many inefficient allocations. Let’s say we can get an optimal allocation for all these items and bins using another algorithm. Now, we know the optimal allocations of all the items.
Rectangle Slicing Optimization Like Rectangle Packing Problem
I have an optimization project. In this project, I am working with a cardboard cutting machine. I need to optimize the layout of the desired final products on the cardboard. The machine needs to cut all the way along the axis it is cutting. How can I optimize this process accordingly? Is there an algorithm for this?