Abstract
Linkage identification algorithms identify linkage groups — sets of loci tightly linked — before genetic optimizations for their recombination operators to work effectively and reliably. This paper proposes a parallel genetic algorithm (GA) based on the linkage identification algorithm and shows its effectiveness compared with other conventional parallel GAs such as master-slave and island models. This paper also discusses applicability of the parallel GAs that tries to answer “which method of the parallel GA should be employed to solve a problem?”
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
Erick Cantú-Paz. Designing Efficient and Accurate Parallel Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, 1999.
D. E. Goldberg. Sizing populations for serial and parallel genetic algorithms. pages 70–79, 1989. (Also TCGA Report 88004).
D. E. Goldberg, K. Deb, and B. Korb. Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4:415–444, 1990.
David E. Goldberg. Using time effectively: Genetic-evolutionary algorithms and the continuation problem. Technical Report IlliGAL Report No.99002, University of Illinois at Urbana-Champaign, 1999.
Masaharu Munetomo. Linkage identification based on epistasis measures to realize efficient genetic algorithms. In Proceedings of the 2002 Congress on Evolutionary Computation, 2002.
Masaharu Munetomo and David E. Goldberg. Designing a genetic algorithm using the linkage identification by nonlinearity check. Technical Report IlliGAL Report No.98014, University of Illinois at Urbana-Champaign, 1998.
Masaharu Munetomo and David E. Goldberg. Identifying linkage by nonlinearity check. Technical Report IlliGAL Report No.98012, University of Illinois at Urbana-Champaign, 1998.
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
Munetomo, M., Murao, N., Akama, K. (2003). A Parallel Genetic Algorithm Based on Linkage Identification. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_129
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive