Separating list of numbers into groups.

Hi, if I have list of around 45 numbers represent various height of an objects, and I need to make few groups that the sum the height of the objects, and that the sum of each group will be less the 400. How can I get the lowest number of group possible, be trying to sum different objects in each group to optimize the result?

Is it the case of using Galapagos ? Can I get a direction or an example ?

Tnx.

Replies to This Discussion

Permalink Reply by David Rutten on October 25, 2016 at 2:19am

I think it will be quite difficult to make sure you end up with the best possible solution. There are a lot of ways to pick groups out of a collection of 45 things (and I do mean a lot) so there's no hope of trying them all.

Galapagos _may_ be able to help, but it tends not to do too well on combinatorial problems, it likes problems that can be varied smoothly, rather than discreetly.

RSS