A parallel genetic algorithm based on linkage identification

Authors:
Masaharu Munetomo;Naoya Murao;Kiyoshi Akama
Affiliations:
Hokkaido University, Sapporo, Japan;Hokkaido University, Sapporo, Japan;Hokkaido University, Sapporo, Japan
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 2
Cited 3

Designing efficient and accurate parallel genetic algorithms (parallel algorithms)

Designing efficient and accurate parallel genetic algorithms (parallel algorithms)
Linkage identification based on epistasis measures to realize efficient genetic algorithms

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02

Empirical investigations on parallel competent genetic algorithms

Proceedings of the 10th annual conference on Genetic and evolutionary computation
The design, usage, and performance of GridUFO: A Grid based Unified Framework for Optimization

Future Generation Computer Systems
A framework of grid problem-solving environment employing robust evolutionary search

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory

Quantified Score

Hi-index	0.00

Visualization

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