Explicit filtering of building blocks for genetic algorithms

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic algorithms reveals some interesting insights, and we discus how the filtering algorithm can be used to build a powerful hybrid genetic algorithm.

Cite

CITATION STYLE

APA

van Kemenade, C. (1996). Explicit filtering of building blocks for genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1141, pp. 494–503). Springer Verlag. https://doi.org/10.1007/3-540-61723-X_1013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free