| Article ID: | iaor1997638 |
| Country: | United Kingdom |
| Volume: | 47 |
| Issue: | 5 |
| Start Page Number: | 702 |
| End Page Number: | 709 |
| Publication Date: | May 1996 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Al-Sultan K.S., Hussain M.F., Nizami J.S. |
| Keywords: | genetic algorithms |
In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. The paper proposes 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.