A parallel genetic algorithm based on linkage identification

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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?" © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Munetomo, M., Murao, N., & Akama, K. (2003). A parallel genetic algorithm based on linkage identification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2723, 1222–1233. https://doi.org/10.1007/3-540-45105-6_129

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free