Optimal Gene-based Genetic Algorithm Research

Genetic Algorithm is a part of evolutionary computing originally invented by Dr J.Holland in the year 1975 and developed by him and his students and colleges. As can be seen literally, Genetic Algorithm is inspired by Darwins theory about evolution. GAs are inherently parallel optimization procedures, which utilize a "survival of the fittest" approach. A basic GA employs selection, crossover and mutation operators. The main characteristic of the GA is that it is simple, universal and robust. After about 20 year's development, GA has been successfully used in a lot of fields such as the Travelling Salesman Problem, Scheduling, Function Optimization, Machine Learning etc.This essay has mainly explained and evolved the basic principle of the algorithm in chapter one, which has narrated the groundwork of the basic principle and this essay of the genetic algorithm and studied briefly. It has narrated the settlement including various kinds of operators and parameters of the algorithm of various kinds of theories of the genetic algorithm and theory that is correlated with especially in chapter two, and it has described the application in concentrating the project field of genetic algorithm emphatically. Simple genetic algorithms gets local minimization too easily a nd converges slowly. To solve these problems, the improvement to the generation of initial population, the indication in the compete selection and the design of adaptive mutation rate that has inverse proportion to the numbers of iterat ion and direct proportion to the distance of parents are put forward.In order to solve the problem of slow- footed convergence in inheritance arithmetic,we bring forward an inheritance arithmetic based on the best gene.the arithmetic can be applied in the best answer of nction ,the result shows it can promote the speed of achieving the best answer...