Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 702-709 |
| Number of pages | 8 |
| Journal | Journal of the Operational Research Society |
| Volume | 47 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 1996 |
Keywords
- 0 to 1 integer programs
- Chvatal's algorithm
- Genetic algorithm
- Implicit enumeration
- Lagrangian heuristic
- NP complete problem
- Set-covering problem
ASJC Scopus subject areas
- Modeling and Simulation
- Strategy and Management
- Statistics, Probability and Uncertainty
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'A genetic algorithm for the set covering problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver