2008 10th IEEE International Conference on High Performance Computing and Communications 2008
DOI: 10.1109/hpcc.2008.77
|View full text |Cite
|
Sign up to set email alerts
|

A Survey: Genetic Algorithms and the Fast Evolving World of Parallel Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0
2

Year Published

2009
2009
2017
2017

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 8 publications
0
12
0
2
Order By: Relevance
“…Many variants of GAs exists depending on evaluation method of new chromosomes, a calculation method using serial or parallel processors, combination with some local optimization algorithms (hill climbing, etc), and other factors [23].…”
Section: Optimization Methods Using Pso and Gamentioning
confidence: 99%
“…Many variants of GAs exists depending on evaluation method of new chromosomes, a calculation method using serial or parallel processors, combination with some local optimization algorithms (hill climbing, etc), and other factors [23].…”
Section: Optimization Methods Using Pso and Gamentioning
confidence: 99%
“…If the random number r i and q 10 <r<q 11 , v i =v 11 . Obviously, some chromosomes would be selected more than once.…”
Section: Choicementioning
confidence: 99%
“…They are a particular class of Evolutionary Algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover. GAs constructs a population of probable solutions and evolves it over the generations to find a better individual that is close to the optimal solution [11]. GAs are a part of evolutionary computing, which is a rapidly growing area of artificial intelligence.…”
Section: Introductionmentioning
confidence: 99%
“…The large literature on distributed and parallel genetic algorithms dates back to Grosso [11], who explored the idea of subdividing a GA population into smaller subpopulations with occasional exchanges of fit individuals among the populations. More recent work ranges from implementations tailored to particular hardware configurations [12,22] to a wide variety of algorithms in which the population is partitioned and individuals are shared among the partitions according to different schemes, e.g., [22]. Parameter tuning (population size, migration rate, etc.)…”
Section: Related Workmentioning
confidence: 99%