A Genetic Algorithm for the Set Covering Problem

In 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.

[1]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[2]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[3]  G. Nemhauser,et al.  Integer Programming , 2020 .

[4]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[5]  Katta G. Murty,et al.  Linear and combinatorial programming , 1976 .

[6]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Edward Keefer Baker,et al.  Efficient heuristic solutions for the airline crew scheduling problem , 1979 .

[9]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[10]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[13]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[14]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[15]  G Mitra,et al.  Set covering and set partitioning: A collection of test problems , 1990 .

[16]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[17]  Ana Paias,et al.  State space relaxation for set covering problems related to bus driver scheduling , 1993 .

[18]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[19]  Salim Haddadi,et al.  Simple Lagrangian heuristic for the set covering problem , 1997 .