Skip to main content
Log in

Characterizing crossover in genetic algorithms

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We characterize crossover and schemata; crossover is a binary operator that preserves schemata and commutes with addition and projection. Moreover, for any setS of chromosomes and familyF of crossover operators, we fully characterize the reachable chromosomes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Baluja, Adaptive parallel genetic algorithms, DOE-ORNL/ORAU, Science and Engineering Research Semester term report, Oak Ridge, TN (1990).

  2. W.W. Bledsoe, The use of biological concepts in the analytical study of systems, Paper presented at the ORSA-TIMS national meeting, San Francisco, CA (1961).

  3. L.B. Booker, Improving search in genetic algorithms, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Pitman, London, 1987) pp. 61–73.

    Google Scholar 

  4. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Doctoral dissertation, University of Michigan, Dissertation Abstracts International 36(10) (1975) 5140B (University Microfilms No. 76-9381).

  5. A.E. Eiben, E.H.L. Aarts and K.M. van Hee, Global convergence of genetic algorithms: An infinite Markow chain analysis,1st Int. Workshop on Problem Solving from Nature, Dortmund, Germany (1990).

  6. L. Eschelman, The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, in: Foundations of Genetic Algorithms, ed. J.E. Rawlins (Morgan Kaufmann, San Mateo, 1991) pp. 265–283.

    Google Scholar 

  7. L.T. Fogel, A.T. Owens and M.T. Walsh,Artificial Intelligence Through Simulated Evolution (Wiley, New York, 1966).

    Google Scholar 

  8. D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989).

  9. D.E. Goldberg, K. Deb and B. Korb, Messy genetic algorithms revisited: studies in mixed size and scale, Complex Systems 4 (1990) 445–460.

    Google Scholar 

  10. J.J. Grefenstette, GENESIS: a system for using genetic search procedures,Proc. 1984 Conf. on Intelligent Systems and Machines (1984) pp. 161–165.

  11. J.J. Grefensette, Optimization of control parameters for genetic algorithms, IEEE Trans. Systems, Man, and Cybernetics, SMC-16 (1986) 122–128.

    Google Scholar 

  12. J.H. Holland,Adaptation in Natural and Artificial Systems (The University of Michigan Press, Ann Arbor, 1975).

    Google Scholar 

  13. G.E. Liepins and S. Baluja, apGA: an adaptive parallel genetic algorithm, accepted by Computer Science and Operations Research: New Developments in Their Interfaces.

  14. G. Syswerda, Uniform crossover in genetic algorithms, in:Proc. 3rd Int. Conf. on Genetic Algorithms, ed. T.D. Schaffer (Morgan Kaufmann, 1989) pp. 2–9.

  15. D. Whitley and T. Starkweather, GENITOR II: a distributed genetic algorithm, J. Exp. Theor. Art. Int. 2 (1990) 189–214.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research sponsored in part by the Air Force Office of Scientific Research and Office of Naval Research (F49620-90-C-0033), and by the National Science Foundation (IRI-8917545).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liepins, G.E., Vose, M.D. Characterizing crossover in genetic algorithms. Ann Math Artif Intell 5, 27–34 (1992). https://doi.org/10.1007/BF01530778

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01530778

Keywords

Navigation