A genetic algorithm for the set covering problem

European Journal of Operational Research

Volumn 94, Issue 2, 1996, Pages 392-404

  Beasley, J E ^a   Chu, P C ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Combinatorial optimisation; Genetic algorithms; Set covering

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION; FITNESS BASED CROSSOVER OPERATOR; HEURISTIC FEASIBILITY OPERATOR; SET COVERING PROBLEM; VARIABLE MUTATION RATE;

GENETIC ALGORITHMS;

EID: 0030259057     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00159-X     Document Type: Article

References (19)

1. T. Bäck, "Optimal mutation rates in genetic search", in: S. Forrest, ed., Proc. Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1993, 2-9.
2. E. Balas and A. Ho, "Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study", Mathematical Programming Study 12 (1980) 37-60.
3. D. Beasley, D.R. Bull, and R.R. Martin, An overview of genetic algorithms: Part I. Fundamentals", University Computing 15 (1993) 58-69.
4. D. Beasley, D.R. Bull, and R.R. Martin, "An overview of genetic algorithms: Part II. Research topics", University Computing 15 (1993) 170-181.
5. J.E. Beasley, "An algorithm for set covering problems", European Journal of Operational Research 31 (1987) 85-93.
6. J.E. Beasley, "A Lagrangian heuristic for set-covering problems", Naval Research Logistics 37 (1990) 151-164.
7. J.E. Beasley and K. Jornsten, "Enhancing an algorithm for set covering problems", European Journal of Operational Research 58 (1992) 293-300.
8. J.J. Dongarra, "Performance of various computers using standard linear equations software", Computer Architecture News 20 (1992) 22-44.
9. M.L. Fisher and P. Kedia, "Optimal solution of set covering/partitioning problems using dual heuristics", Management Science 36 (1990) 674-688.
10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
11. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, New York, 1989.
12. T. Grossman and A. Wool, "Computational experience with approximation algorithms for the set covering problem", Working paper, Theoretical Division and CNLS, Los Alamos National Laboratory, Los Alamos, NM, February 1995.
13. F. Harche and G.L. Thompson, "The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems", Computers & Operations Research 21 (1994) 689-705.
14. J.H. Holland, Adaption in Natural and Artificial Systems, MIT Press, Cambridge, MA, 1975.
15. L.W. Jacobs and M.J. Brusco, "A simulated annealing-based heuristic for the set-covering problem", Working paper, Operations Management and Information Systems Department. Northern Illinois University, Dekalb, IL, March 1993.
16. C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific, 1993.
17. J. Richardson, M. Palmer, G. Liepins, and M. Hilliard, "Some guidelines for genetic algorithms with penalty functions", in: J. Schaffer, ed., Proc. Third International Conference on Genetic Algorithms, Morgan Kaufmann, 1989, 191-197.
18. S. Sen, "Minimal cost set covering using probabilistic methods", Proc. 1993 ACM/SIGAPP Symposium on Applied Computing, 1993, 157-164.
19. F.J. Vasko and G.R. Wilson, "An efficient heuristic for large set covering problems", Naval Research Logistics Quarterly 31 (1984) 163-171.