يك روش ابتكاري كارآمد براي حل مسايل پوشش مجموعه

Set covering problem is covering the rows of a matrix by subset of the columns at minimum cost. Considering the fact that set covering problem is a NP-complete one, most contemporary researchers have tried recently to focus on applying heuristic algorithms to solve the above problem. The most promising heuristic method is genetic algorithm trying to simulate the natural evolution process. This algorithm is an efficient and suitable approach to handle set covering problems. In this paper, a special design of the proposed genetic algorithm is used to solve such problems. The computational result of great trails confirms the efficiency of genetic algorithms.