Evolutionary divide and conquer for the set-covering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1143, Issue , 1996, Pages 198-208

  González Hernández, Luis F ^a   Corne, David W ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF READING   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; STOCHASTIC SYSTEMS;

COMPLETE SOLUTIONS; COMPLEX FORESTS; DIVIDE AND CONQUER; GENETIC ALGORITHM (GAS); HILL CLIMBING; SEARCH SPACES; SET COVERING PROBLEM; STOCHASTIC SEARCH METHODS;

FACTORY AUTOMATION;

EID: 77952240052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0032784     Document Type: Conference Paper

References (15)

1. E. Balas and A. Ho. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Mathematical Programming Study, 12:37-60, 1980.
2. J. E. Beasley. OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069-1072, 1990.
3. J.E. Beasley and P.C. Chu. A genetic algorithm for the set covering problem. Submitted to the European Journal of Operational Reseach, June 1995.
4. D. R. Bull, D. Beasley, and R. Martin. Reducing epistasis in combinatorial problems by expansive coding. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 400-407. Morgan Kaufman, 1993.
5. Y. Davidor. A naturally occuring niche and species phenomenon: the model and first results. In R. K. Belew and L. B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 257-263. Morgan Kaufmann, 1991.
6. K. DeJong. The Analysis and behaviour of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
7. M.R. Garey and D.S. Johnson. Computer8 and Intractability: A Guide to the Theory of NP.Completeness. W.H. Freeman and Co., San Francisco, 1979.
8. L. F. González Hernámdez. Evolutionary divide and conquer for the set covering problem. Master's thesis, Department of Artificial Intelligence, University of Edinburgh, September 1995.
9. L.W. Jacobs and M.J. Brusco. A simulated annealing-based heuristic for the setcovering problem. Working paper, Operations Management and Information Systems Department, Northern Illinois University, Dekalb,IL 60115, USA, March 1993.
10. G. E. Liepins and W. D. Potter. A genetic algorithm approach to multiple-fault diagnosis. In L. Davis, editor, Handbook of Genetic Algorithms, chapter 17, pages 237-250. Van Nostrand Reinhold, New York, 1991.
11. G.E. Liepins and M. R. Hilliard. Greedy genetics. In J. Grefeustette, editor, Proceedings of the Second International Conference on Genetic Algorithm on Genetic Algorithms, pages 90-99. Lawrence Erlbaum Associates, 1987.
12. R.F. Marsten and F. Shepardson. Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications. Networks, 11(2):165-177, 1981.
13. Z. Michalewicz. Genetic Algorithms -I- Data Structures = Evolution Programs. Springer Verlag, second edition, 1994.
14. V. Nissen. Evolutionary algorithms in management science: An overview and list of references. Number 9303 in Papers on Economics and Evolution. European Study Group for Evolutionary Economics, Interdisziplinares Graduiertenkolleg, Universitaet Goettingen, Gosslerstr. 12a, D-37073 Goettingen, Germany, July 1993.
15. D. Whitley and T. Starkweather. Genitor II: a distributed genetic algorithm. Journal of Experimental and Theoretical Artificial Intelligence, 2:189-214, 1990.