combinatorics - Combinatorial optimization (tell which and how many) -
i have problem given k types of object need assign number of them each of elements of group. instance this:
object types: a, b, c, d places: 1, 2, 3, 4 simple trial combination: place | object type | amount ---------------------------- 1 | | 3 2 | | 1 3 | d | 2 4 | c | 5
the evaluation of each combination produces number want minimize.
mainly part confuses me need choose objects list , tell amount of them.
from background i'd try put problem genetic algorithm, wonder if there better suited solve this.
any guidance appreciated.
Comments
Post a Comment