Study of Basic Principles of Genetic Algorithms
Keywords:
Genetic Algorithms, Fitness, CrossoverAbstract
Genetic Algorithms were de on the theory of natural selection which takes these solutions to multiply and take the best Fitness value of thus produced progeny is calculated and further breeding is done for millions of generations and the best offspring can solution to the problem i.e. timetable optimization, CPU scheduling etc. paper reviews the genetic algorithm its benefits, applications and various steps need to be applied to use genetic algorithm or problem solving.
References
Schaerf, et. al., “A survey of automated timetabling”, Artificial intelligence review,1999, 13(2), 87
D.E Goldberg, “Genetic Algorithms in search, Optimization and machine learning”,
J. E. Smith, et. al., “Operator and parameter adaptation in genetic algorithms,” methodologies and applications, vol. 92, pp. 81
H. Holland,” Adaptation in Natural and Artificial Systems” The University of Michigan Press, Ann Arbor, Michigan, 1975.
M. Sipper. “Machine Nature: The Coming Age of Bio Rakesh Kumar, “Study of selection and replacement on performance of genetic algorithms”, 2012, ISSN 2231-4334.
Tomasz DominikGwiazda , “ Genetic algorithm reference: Crossover for single objective Omar Al Jadaan,et. al., “Improved Selection Operator For GA” 2005 - 2008 JATIT.
N. Chaiyarataiia and A. M. S. Zalzala, “ Applications”, Genetic Algorithms in Engineering Systems: Innovations and Applications, 2
Dr. Hamid Nemati “Genetic Algorithms” an intenet draft.
