2016
DOI: 10.1007/978-81-322-2752-6_72
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of Genetic Algorithm’s Selection Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 15 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…(1) Natural evolution. The GA is the representative of this kind of algorithm [7,8,9,10,11,12] In addition, the mutation based evolutionary strategy and evolutionary planning are not suitable for solving problems with abstract constraints and goals. Genetic planning is a variation of GA, the difference is that the individuals of this algorithm is a function.…”
Section: Meta Heuristic Algorithmsmentioning
confidence: 99%
“…(1) Natural evolution. The GA is the representative of this kind of algorithm [7,8,9,10,11,12] In addition, the mutation based evolutionary strategy and evolutionary planning are not suitable for solving problems with abstract constraints and goals. Genetic planning is a variation of GA, the difference is that the individuals of this algorithm is a function.…”
Section: Meta Heuristic Algorithmsmentioning
confidence: 99%
“…The success of these algorithms are mainly depends on the parameters they used. For example, the GA's success depends on the crossover and mutation rate, selection method used [4][5][6]. Similarly, cooling rate is the key for the success of the Simulated Annealing (SA) [7].…”
Section: Introductionmentioning
confidence: 99%