论文信息 - Genetic Algorithm: A Search of Complex Spaces

Genetic Algorithm: A Search of Complex Spaces

species solve very complex problem of optimization through the mechanism of evolution and natural selection. Genetic Algorithm has been a field of active interest and applied to solve problems almost in all the fields like Computer Science, Electrical Engg., Mechanical Engg., Optimization, Biology and Image Processing etc. One important application of Genetic Algorithm is to search complex spaces and function optimization. A genetic algorithm begins its search with random solution of the problem. The initial population is evolved to new population using Genetic operators like reproduction, crossover and mutation. A Genetic Algorithm keeps evolving the successive populations unless some criterion is met or a reasonable acceptable solution is found. In this paper Genetic Algorithm has been applied to schwefel function to find the best fit chromosome so far.

Khurana Namita | Rathi Anju | Khurana Namita | R. Anju

[1] Tom V. Mathew. Genetic Algorithm , 2022 .

[2] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[3] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4] Thomas Weise,et al. Global Optimization Algorithms -- Theory and Application , 2009 .

[5] Atam P. Dhawan,et al. Genetic Algorithms as Global Random Search Methods: An Alternative Perspective , 1995, Evolutionary Computation.

[6] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7] Laura Painton,et al. Genetic algorithms in optimization of system reliability. , 1995 .

[8] Naveen Toppo,et al. Pointers in C , 2013, Apress.

[9] James E. Baker,et al. Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[10] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .