Set Covering Problem, Genetic Algorithm and Its Domain Specific Knowledge

摘要

In this paper, we propose a genetic algorithm to solve the Set Covering Problem. Here, we make some improvements in getting some better feasible solutions, i.e better chromosomes at the first starting population, taking full account of Domain Specific Knowledge. We have inplemented our ideas to solve some medium sized Set Covering input data with computational experiments.