![Genetic Algorithms + Data Structures = Evolution Programs [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Genetic Algorithms + Data Structures = Evolution Programs [electronic resource] /
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.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1996
|
| Subjects: | Computer science., Software engineering., Computer programming., Artificial intelligence., Algorithms., Numerical analysis., Computer Science., Artificial Intelligence (incl. Robotics)., Software Engineering/Programming and Operating Systems., Numerical Analysis., Programming Techniques., Software Engineering., |
| Online Access: | http://dx.doi.org/10.1007/978-3-662-03315-9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|