You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
David
Would you please suggest how one could modify the code so that rather than just packing only one box at a time, that it would have an infinite number of each of the specified containers, and find the 'optimal' (or very good ;) packing of all items, for the minimum total container volume.
The text was updated successfully, but these errors were encountered:
Pass all known items and boxes into the PackingService.Pack method and first find which container has the highest PercentContainerVolumePacked. You can then get all of the UnpackedItems from there and re-run the PackingService.Pack method with those UnpackedItems (again finding which container has the highest PercentContainerVolumePacked) until all items are packed. In the end, you would have the multiple boxes in which everything was packed in.
David
Would you please suggest how one could modify the code so that rather than just packing only one box at a time, that it would have an infinite number of each of the specified containers, and find the 'optimal' (or very good ;) packing of all items, for the minimum total container volume.
The text was updated successfully, but these errors were encountered: