Skip to main content

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

  • 338 Accesses

Abstract

In order to handle linkage evolution and to tackle the ordering problem, Harik [47] took Holland’s call [53] for the evolution of tight linkage quite literally and proposed the linkage learning genetic algorithm (LLGA), which is capable of learning genetic linkage in the evolutionary process. The linkage learning genetic algorithm used a special probabilistic expression mechanism and a unique combination of the (gene number, allele) coding scheme and an exchange crossover operator to create an evolvable genotypic structure that made genetic linkage learning natural and viable for genetic algorithms. As the subject of this study, the design, works, accomplishments, and limitations of the linkage learning genetic algorithm are presented and discussed in this chapter. Detailed background and comprehensive description can also be found elsewhere [47, 49, 50].

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. Linkage Learning Genetic Algorithm. 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_4

Download citation

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

  • 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