Packaging Algorithm -
I have found a set of items with related attributes (weight, length, width). I related characteristics (maximum weight, length, width) has got a set of packaging type
I'm looking for an algorithm to determine at least one box of items to the package I am here. / P>
So far, I have detected the problem of the lid, and although it may come closer, I'm not really dealing with a weight, price type problem.
Here is an example:
Item: 10 x item # 1, (1 lb each, 24 "long, 12" wide) 5 x item # 2, (2 lb each) 24 "long, 6" wide)
packaging type: small box (Makswait = 40 lbs, 24 "x 12") large box (Makswait = 75 lbs, 24 "x 24")
will be possible ways to package: 2x small box -> Forests -> it everything
I have to return a box results for each type of item 1x big box, but if I do all possible combinationsProgramming can go back, then it will work.
Are you describing Note that this problem is NP-hard, so you Bruce Force Without optimal solution will not find. He said, there are algorithms that give you an adequate answer to the IMO. Search around for details of
best fit minimize and first fit .
Comments
Post a Comment