Genetic Algorithms + Data Structures = Evolution Programs, Second, Extended Edition by Zbigniew Michalewicz
English | PDF | 1994 | 345 Pages | ISBN : N/a | 28.2 MB
Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques has been growing in the last decade, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.
