A GENETIC ALGORITHM FOR THE SET COVERING PROBLEM

Authors
ALSULTAN KS HUSSAIN MF NIZAMI JS
Citation
Ks. Alsultan et al., A GENETIC ALGORITHM FOR THE SET COVERING PROBLEM, The Journal of the Operational Research Society, 47(5), 1996, pp. 702-709
Citations number
24
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
The Journal of the Operational Research Society → ACNP
ISSN journal
01605682
Volume
47
Issue
5
Year of publication
1996
Pages
702 - 709
Database
ISI
SICI code
0160-5682(1996)47:5<702:AGAFTS>2.0.ZU;2-S
Abstract
In this paper, the set covering problem (SCP) is considered. Several a lgorithms have been suggested in the literature for solving it. We pro pose 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 prob lem.