Skip to main content

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 190))

  • 249 Accesses

Abstract

This chapter provides a summary of fundamental materials on genetic algorithms. It presents definitions of genetic algorithm terms and briefly describes how a simple genetic algorithm works. Then, it introduces the term genetic linkage and the so-called linkage problem that exists in common genetic algorithm practice. The importance of genetic linkage is often overlooked, and this chapter helps explain why linkage learning is an essential topic in the field of genetic and evolutionary algorithms. More detailed information and comprehensive background can be found elsewhere [28, 32, 53].

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this chapter

Cite this chapter

Chen, Yp. Genetic Algorithms and Genetic Linkage. In: Extending the Scalability of Linkage Learning Genetic Algorithms. Studies in Fuzziness and Soft Computing, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11339380_2

Download citation

  • DOI: https://doi.org/10.1007/11339380_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28459-8

  • Online ISBN: 978-3-540-32413-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics