An indirect genetic algorithm for the non-unicost set covering problem is presented. The algorithm is a two-stage meta … are an ‘indirect' genetic algorithm and a decoder routine. First, the solutions to the problem are encoded as permutations … of the rows to be covered, which are subsequently ordered by the genetic algorithm. Fitness assignment is handled by the …