Skip to main content

Introducing Subchromosome Representations

  • Chapter
  • First Online:
Extending the Scalability of Linkage Learning Genetic Algorithms

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

Abstract

While the linkage learning genetic algorithm achieved successful genetic linkage learning on problems with badly scaled building blocks, it was less successful on problems consisting of uniformly scaled building blocks. The convergence time model for the linkage learning genetic algorithm developed in the previous chapter explains the difficulty faced by the linkage learning genetic algorithm and reveals the performance limit of the linkage learning genetic algorithm on uniformly scaled problems. This chapter seeks to enhance the design of the linkage learning genetic algorithm based on the time models in order to improve the performance of the linkage learning genetic algorithm.

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. Introducing Subchromosome Representations. 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_8

Download citation

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

  • 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