Explicit filtering of building blocks for genetic algorithms

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

Volumn 1141, Issue , 1996, Pages 494-503

  van Kemenade, C ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; SIGNAL FILTERING AND PREDICTION;

BIT-STRINGS; BUILDING BLOCKES; FILTERING ALGORITHM; HYBRID GENETIC ALGORITHMS;

PROBLEM SOLVING;

EID: 84958969943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1013     Document Type: Conference Paper

References (14)

1. H. Asoh and H. Mühlenbein. On the mean convergence time of evolutionary algorithms without selection and mutation. In Parallel Problem Solving from Nature - 3, pages 88-97, 1994.
2. L.J. Eshelman, R.A. Caruana, and J.D. Schaffer. Biases in the crossover landscape. In Third International Conference on Genetic Algorithms, pages 10-19, 1989.
3. D.E. Goldberg. Genetic algorithms and walsh functions: Part II, deception and its analysis. Complex Systems, 3:153-171, 1989.
4. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
5. D.E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using the fast messy genetic algorithms. In Fifth International Conference on Genetic Algorithms, pages 56-64, 1993.
6. D.E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3:493-530, 1989.
7. J.H. Holland. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The university of Michigan Press/Longman Canada, 1975.
8. H. Kargupta. SEARCH, polynomial complexity, and the fast messy genetic algorithm. Technical Report IlliGAL-95008, University of Illinois, October 1995.
9. H. Kargupta. Search, evolution, and the gene expression messy genetic algorithm. Technical Report 96-60, Los Alamos National Laboratory, February 1996.
10. N.J. Radcliffe and P.D. Surry. Fundamental limitations on search algorithms: Evolutionary computing in perspective. In J. van Leeuwen, editor, Computer Science Today -- Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 275-291. Springer-Verlag, 1995.
11. D. Thierens. Analysis and Design of Genetic Algorithms. Doctoral dissertation, University of Leuven, Belgium, 1995.
12. D. Thierens and D.E. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Fifth International Conference on Genetic Algorithms, pages 38-45. Morgan Kaufmann, 1993.
13. C.H.M. van Kemenade, J.N. Kok, and A.E. Eiben. Controlling the convergence of genetic algorithms by tuning the disruptiveness of recombination operators. In Second IEEE conference on Evolutionary Computation, pages 345-351. IEEE Service Center, 1995.
14. D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, The Santa Fe Institute, July 1995.