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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
D.E. Goldberg. Genetic algorithms and walsh functions: Part II, deception and its analysis. Complex Systems, 3:153–171, 1989.
D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
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.
D.E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3:493–530, 1989.
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.
H. Kargupta. SEARCH, polynomial complexity, and the fast messy genetic algorithm. Technical Report IlliGAL-95008, University of Illinois, October 1995.
H. Kargupta. Search, evolution, and the gene expression messy genetic algorithm. Technical Report 96-60, Los Alamos National Laboratory, February 1996.
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.
D. Thierens. Analysis and Design of Genetic Algorithms. Doctoral dissertation, University of Leuven, Belgium, 1995.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Kemenade, C.H.M. (1996). Explicit filtering of building blocks for genetic algorithms. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1013
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_1013
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive