Genetic algorithms applied to computationally difficult set covering problems

Journal of the Operational Research Society

Volumn 48, Issue 4, 1997, Pages 440-445

  Lorena, L A N ^a   De Souza Lopes, L ^a  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Genetic algorithms; Optimisation; Set covering problems

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

SET COVERING PROBLEMS (SCP); STEINER TRIPLE SYSTEMS;

NONLINEAR PROGRAMMING;

EID: 0031120428     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600380     Document Type: Article

References (25)

1. Goldberg, D. E., (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley: New York.
2. De Jong, K. A., (1975). Analysis of the behaviour of a class of genetic adaptive systems. Ph.D. Dissertation, Department of Computer and Communication Sciences, University of Michigan: Ann Arbor.
3. Arti®cial Systems. The University of Michigan Press: Ann Arbor.
4. Grefenstette, J. J, Gopal, R., Rosmaita, B. J., Gucht, D. V., (1985). Genetic algorithms for the travelling salesman problem. In Grefenstette J (ed) Proceedings of an International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum, Hillside, NJ, pp 160-168.
5. Levine, D. M., (1993). A genetic algorithm for the set participating problem. In Forrest S (ed) Proceedings of the 5th International Conference on Genetic Algorithms, Morgan Kaufmann, USA, pp 481-487.
6. Tam, K. Y., (1992). Genetic algorithm, function optimization and facility layout design Eur J Op Res 63: 322-340.
7. Vignaux, G. A., Michalewicx, Z., (1991)A genetic algorithm for the linear transportation problem IEEE Trans Systems, Man and Cybernetics 21: 445-452.
8. Garey, M. R., Johnson, D. S., (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman: San Francisco, CA.
9. Christo®ldes N (ed). Combinatorial Optimization. Wiley: New York.
10. Marsten, R. E., Shepardson, F., (1981). Exact solution of crew scheduling problems using the set partitioning problem: Recent successful applications Networks 11: 165-177.
11. Revelle, C., Marks, D., Liebman, S. C., (1970). An analysis of private and public section facilities location models. Mngmt Sci 16: 692-707.
12. Beasley, J. E., (1987). An algorithm for set covering problems. European J Opl Res 31: 85-93.
13. Beasley, J. E., (1987). A Lagrangian heuristic for set covering problems. Naval Res Logist Q 37: 151-164.
14. Beasley, J. E., Chu, P. C., (1994). A genetic algorithm for the set covering problem. Technical ReportÐThe Management School Imperial College, London.
15. ChvaÂtal, V., (1979). A greedy heuristic for the set covering problem. Math Opns Res 4: 233-235.
16. dif®cult set covering problem. Opns Res Lett 8: 67-71.
17. Lorena LAN Lopes, F. B., (1994). A surrogate heuristic for set covering problems. Eur J Opl Res 79: 138-150.
18. dif®cult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math Prog Study 2: 72-81.
19. Hall, M., Jr (1967). Combinatorial Theory, Blaisdell Company: Waltham, MA.
20. dif®cult set covering problems. Math Prog 18: 138-145.
21. dif®cult set covering problems. Math Prog 52: 597-618.
22. Feo, T. A., Resende, M. G. C., (1994). Greedy Randomized Adaptive Search Procedures. AT, T Bell Laboratories Technical Report.
23. Balas, E., Ho, A., (1980). Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. Math Prog 12: 37-60.
24. ef®cient heuristic for large set covering problems. Naval Res Logist Q 31: 163-171.
25. Lopes, L. S., (1995). Uma heurIÂstica baseada em algoritmos geneÂticos aplicada ao problema de cobertura de conjuntos. Master Thesis, INPEÐInstituto Nacional de Pesquisas Espaciais, Brazil.