A genetic algorithm for the set covering problem

In this paper we present a genetic algorithm-based heuristic for non-unicost set covering problems. We propose several modifications to the basic genetic procedures including a new fitness-based crossover operation (fusion), a variable mutation rate and a heuristic feasibility operator tailored specifically for the set covering problem. The performance of our algorithm was evaluated on a large set of randomly generated problems. Computational results showed that the genetic algorithm-based heuristic is capable of producing high-quality solutions.