A Genetic Algorithm for the Set Covering Problem
提出一种基于遗传技术的新算法来解决集合覆盖问题，在标准测试和随机生成问题上表现优于现有启发式方法。
AbstractIn this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on the genetic technique. This algorithm has been implemented and tested on various standard and randomly generated test problems. Preliminary results are encouraging, and are better than the existing heuristics for the problem.Keywords: Chvatal's algorithmgenetic algorithmimplicit enumerationLagrangian heuristicNP-complete problemset-covering problem0–1 integer programs