论文信息 - A Parallel Genetic Algorithm Based on Linkage Identification

A Parallel Genetic Algorithm Based on Linkage Identification

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?"

[1] Erick Cantú-Paz. Designing Efficient and Accurate Parallel Genetic Algorithms , 1999 .

[2] Kalyanmoy Deb,et al. Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale , 1990, Complex Syst..

[3] D.E. Goldberg,et al. A genetic algorithm using linkage identification by nonlinearity check , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[4] David E. Goldberg,et al. Designing efficient and accurate parallel genetic algorithms (parallel algorithms) , 1999 .

[5] David E. Goldberg. Using Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem , 1999, GECCO.

[6] Masaharu Munetomo,et al. Linkage identification based on epistasis measures to realize efficient genetic algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[7] David E. Goldberg,et al. Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.