A Genetic Algorithm Approach for Set Covering Problems

We introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several instances of computationally difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems. We have found better solutions than the currently best-known solutions for two large test problems. >