So, I´m trying to use an simple genetic algorithm with only one goal, however my problem is kinda of complex. So, I have an initial chromosome that will have to be made up of 2 or more groups that also have variable size.

[[ P1, P1] , [P2, P2, P3]]

1 GROUP , 2 GROUP

For example, the first group refers to a single set composed of 2 elements, while the second group has 3 elements, where P2 and P2 are of the same type and P3 of another type but belonging to the same group. My goal is to discover the best combination between both groups (best value of the first and second group) that is, to generate combinations in the end like [P1,P1,P2,P2] or [P1,P1,P3].

This is only a simple example since the problem is variable and can have more or fewer genes/alternatives within each group

However, despite having reformulated this several times, I either end up with results that present all the genes in the end, or I end up with results that don’t make sense in the real context of the problem. I don’t think I can do what they propose with this type of algorithms, but I also don’t know what I could be missing.

Any idea? Thank you!