A CLONALG-based approach for the set covering problem

In this paper, we have proposed a CLONALG-based simple heuristics, which is one of the most popular artificial immune system (AIS) models, for the non-unicost set covering problem (SCP). It is well known that SCP is NP-hard problem that can model several real world situations such as crew scheduling in airlines, facility location problem, production planning in industry etc. In real cases, the problem instances can reach huge sizes, making the use of exact algorithms impracticable. So, for finding practically efficient approaches for solving SCP, different kind of heuristic approaches have been applied in the literature. To the best of our knowledge our work here, is the first attempt to solve SCP using Artificial Immune System. We have evaluated the performance of our algorithm on a number of benchmark instances. Computational results have shown that it is capable of producing high-quality solutions.