遗传算法（genetic algorithm）.doc

遗传算法（genetic algorithm） The first chapter is introduction Genetic algorithm is a kind of reference biological natural selection and genetic mechanism of the random search algorithm, proposed by Professor J.Holland, its main characteristic is the exchange of information between the individual group search and search, do not depend on gradient information. It is especially suitable for complex and nonlinear problems in traditional search methods are difficult to solve, the light is widely used in combinatorial optimization, machine learning, adaptive control, planning design and other fields, is one of the key technologies of Intelligent Computing in twenty-first Century. This chapter starts from the evolution of talk, then introduces the methods and steps of the design example of simple genetic algorithm, and then sums up the general characteristics of genetic algorithm, and finally briefly introduces the research history and status quo of the genetic algorithm and the future research will be the main topic 1.1 INTRODUCTION Cross, science and Engineering Science of life of mutual penetration and mutual promotion is one of the distinctive features of the development of modern science and technology, and the rapid development of genetic algorithm embodies the characteristics and trend of scientific development. The genetic algorithm (Genetic Algorithm-GA), is a calculation model for simulation of Darwins natural selection of genetic selection and biological evolution, it was first proposed by Professor J.Holland Michigan of the University of the United States in 1975 [1]. Professor J.Holland and his research team focus on genetic algorithms for two purposes, one is the extraction and interpretation of adaptive processes in natural systems, and two the other is the design of artificial systems with natural system mechanisms. There is no doubt that Professor Hollands research is meaningful both for the white system and for the artificial system. As we all know, in the fi