Abstract

Genetic Algorithm solves a problem using an evolutionary approach by generating mutations to the current solution method, selecting the better methods from this new generation, and then using these improved methods to repeat the process. Selection is the process of finding out the best individuals for mating process so that the offsprings are produced are fit than the previous population. This paper reviews the commonly used selection methods.

Downloads

Download data is not yet available.

We Recommend


Author's Affiliation
Article Details

Issue: Vol 6 No 12 (2017)
Page No.: 22261-22263
Section: Articles
DOI:


 How to Cite
Saini, N. (2017). Review of Selection Methods in Genetic Algorithms. International Journal Of Engineering And Computer Science, 6(12), 22261-22263. Retrieved from http://ijecs.in/index.php/ijecs/article/view/2562

 Cited by


Article level Metrics by Paperbuzz/Impactstory:

 Statistics at Article Level
HTML = 18 times
PDF   = 129 times
Total   = 129 times