Replies: 2 comments
-
|
Hi, Thank you for this example. I may have something in a few days to improve the solutions on this kind of problems with high height and low width. But I think that the solution you showed cannot be reached by the current algorithms of the solver. |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
Thanks for the update! That sounds interesting—looking forward to your new solution. Whenever you implement the solution, please do inform here or share it in this discussion. It would be great to review and learn from it. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hi,
I’ve been testing the solver using the provided input file:
input_01.json
Getting below result
Final statistics
Time (s): 45.0311
Solution
Number of items: 30 / 30 (100%)
Item area: 392421 / 392421 (100%)
Item profit: 392421 / 392421 (100%)
Number of bins: 1 / 1 (100%)
Bin area: 2000000 / 2000000 (100%)
Bin cost: 2e+06
Full waste: 1.60758e+06
Full waste (%): 80.379
X min: 10
Y min: 10
X max: 555.319
Y max: 988.363
Density X: 0.706659
Density Y: 0.198521
ODXY area: 533520
Leftover value: 1.45114e+06
Other third party solver
Can we get below optimised solution which is better?


I am observing that our solution results in an X max of 55.5319 cm, whereas the reference solution achieves 53.582 cm, indicating better horizontal compaction.
Beta Was this translation helpful? Give feedback.
All reactions