Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Non-optimal results #27

Open
photoneffect opened this issue Nov 12, 2017 · 0 comments
Open

Non-optimal results #27

photoneffect opened this issue Nov 12, 2017 · 0 comments

Comments

@photoneffect
Copy link

With the following values I get a less than optimal result:

bin:
0:50:22x18x16

items:
0:0:5:20.75x17x4,
1:0:5:19x12.5x6.5,
2:0:5:16.5x15x4,
3:0:5:16.5x15x4,
4:0:5:16.5x15x4

It only places 3 items in this bin. If I remove the last item it places 4 items in. Additionally, there is less wasted space in the second scenario. I could iterate over all the possible permutations and submit multiple calls, but I thought the algorithm did that itself. Is there a reason this doesn't return the most efficient result?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant