2008 4th International Conference on Wireless Communications, Networking and Mobile Computing 2008
DOI: 10.1109/wicom.2008.1275
|View full text |Cite
|
Sign up to set email alerts
|

The Analysis and Research of Parallel Genetic Algorithm

Abstract: With the application of the genetic algorithm (GA) deeply developed, the research of parallel genetic algorithm (PGA) and its realization become very important. Because of PGA inner parallel mechanism, its parallel process becomes a very naturally resolvable method. In this paper, four kinds of parallel models of parallel genetic algorithms, such as masterslave model, coarse-grained model, fine-grained model and mixed model, are simply generalized and evaluated. For every model, its characteristics are display… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Among them, coarse-grained parallel genetic algorithm distributes several sub populations to their corresponding processor, each processor is not only independent of calculation fitness, but also independent of selection, restructure crossover and mutation operation, and regularly send each other the best individual fitness, thus speeding up to meet the requirements of the termination conditions. It is a parallel genetic algorithm of the most widely used currently [7].…”
Section: Parallel Genetic Algorithmmentioning
confidence: 99%
“…Among them, coarse-grained parallel genetic algorithm distributes several sub populations to their corresponding processor, each processor is not only independent of calculation fitness, but also independent of selection, restructure crossover and mutation operation, and regularly send each other the best individual fitness, thus speeding up to meet the requirements of the termination conditions. It is a parallel genetic algorithm of the most widely used currently [7].…”
Section: Parallel Genetic Algorithmmentioning
confidence: 99%
“…It helps generate useful solutions to search problems. Various problem models in various applications were solved such as Travelling Salesman Problem (TSP), production scheduling, function optimization, machine language and so forth [3]. Parallel Genetic Algorithm (PGA) is referred as an algorithm that works by dividing large problem into smaller tasks.…”
Section: Introductionmentioning
confidence: 99%