The application of genetic algorithms to optimisation problems for which the solution is a set or multiset (bag) is considered. A previous extension of schema analysis, known as forma analysis, is further developed and used to construct principled representations and operators for problems in this class. The extensions to forma analysis include the introduction of genes whose values cannot be assigned independently and a method for mediating between desirable but sometimes incompatible properties of recombination operators.