Abstract
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. The population-sizing model suggests that for moderate-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for single-point crossover scales as O (2k m 1.5), where k is the BB size, and m is the number of BBs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI (1975)
Goldberg, D.E.: Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading, MA (1989)
Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333–362 (Also IlliGAL Report No. 91010).
Goldberg, D.E.: Design of innovation: Lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Boston, MA (2002)
Goldberg, D.E., Thierens, D., Deb, K.: Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers 32 (1993) 10–16 (Also IlliGAL Report No. 92009).
Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. Proceedings of the Fifth International Conference On Genetic Algorithms (1993) 38–45.
Sastry, K., Goldberg, D.E.: Analysis of mixing in genetic algorithms: A survey. IlliGAL Report No. 2002012, University of Illinois at Urbana-Champaign, Urbana, IL (2002)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann-Arbor, MI (1975)
Syswerda, G.: Uniform crossover in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms (1989) 2–9.
De Jong, K.A., Spears, W.M.: A formal analysis of the role of multi-point crossover in genetic algorithms. Annals of Mathematics and Artificial Intelligence 5 (1992) 1–26.
Goldberg, D.E., Sastry, K.: A practical schema theorem for genetic algorithm design and tuning. Proceedings of the Genetic and Evolutionary Computation Conference (2001) 328–335 (Also IlliGAL Report No. 2001017).
Christiansen, F.B.: The effect of population subdivision on multiple loci without selection. In Feldman, M.W., ed.: Mathematical Evolutionary Theory. Princeton University Press, Princeton, NJ (1989) 71–85.
Booker, L.B.: Recombination distributions for genetic algorithms. Foundations of Genetic Algorithms 2 (1993) 29–44.
Eshelman, L.J., Caruana, R.A., Schaffer, J.D.: Biases in the crossover landscape. Proceedings of the Third International Conference on Genetic Algorithms (1989) 10–19.
Eshelman, L.J., Schaffer, J.D.: Productive recombination and propagating and preserving schemata. Foundations of Genetic Algorithms 3 (1995) 299–313.
Rabani, Y., Rabinovich, Y., Sinclair, A.: A computational view of population genetics. Random Structures & Algorithms 12 (1998) 313–334.
Bridges, C.L., Goldberg, D.E.: An analysis of reproduction and crossover in binary-coded genetic algorithm. Proceedings of the Second International Conference on Genetic Algorithms (1987) 9–13.
Nix, A.E., Vose, M.D.: Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5 (1992) 79–88.
Prügel-Bennett, A., Shapiro, J.L.: An analysis of genetic algorithms using statistical mechanics. Physical Review Letters 72 (1994) 1305–1309.
Stephens, C., Waelbroeck, H.: Schemata evolution and building blocks. Evolutionary computation 7 (1999) 109–124.
Thierens, D.: Scalability problems of simple genetic algorithms. Evolutionary Computation 7 (1999) 331–352.
Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. Foundations of Genetic Algorithms 2 (1993) 93–108 (Also IlliGAL Report No. 91009).
Mühlenbein, H., Schlierkamp-Voosen, D.: Predictive models for the breeder genetic algorithm: I. continuous parameter optimization. Evolutionary Computation 1 (1993) 25–49.
Bäck, T.: Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. Proceedings of the First IEEE Conference on Evolutionary Computation (1994) 57–62.
Thierens, D., Goldberg, D.E.: Convergence models of genetic algorithm selection schemes. Parallel Problem Solving from Nature 3 (1994) 116–121.
Harik, G., Cantú-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation 7 (1999) 231–253 (Also IlliGAL Report No. 96004).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sastry, K., Goldberg, D.E. (2003). Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive