Genetic Algorithms + Data Structures = Evolution Programs
Book information
Description
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 is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science. The book is self-contained and the only prerequisite is basic undergraduate mathematics. This third edition has been substantially revised and extended by three new chapters and by additional appendices containing working material to cover recent developments and a change in the perception of evolutionary computation.
Similar books
How to Solve It: Modern Heuristics
2004 · PDF
Jak to rozwiązać czyli nowoczesna heurystyka
2006 · PDF
Nauczanie łamigłówkowe
2010 · PDF
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
2017 · PDF
How to Solve It: Modern Heuristics
1999 · DJVU
Intelligent Media Technology for Communicative Intelligence: Second International Workshop, IMTCI 2004, Warsaw, Poland, September 13-14, 2004. Revised Selected Papers
2005 · PDF
Simulated Evolution and Learning: 7th International Conference, SEAL 2008, Melbourne, Australia, December 7-10, 2008. Proceedings
2008 · PDF
Fuzzy Evolutionary Computation
1997 · PDF