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 travelin
Genetic Algorithms + Data Structures = Evolution Programs
โ Scribed by Zbigniew Michalewicz (auth.)
- Publisher
- Springer Berlin Heidelberg
- Year
- 1992
- Tongue
- English
- Leaves
- 257
- Series
- Artificial Intelligence
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Front Matter....Pages I-XIV
Introduction....Pages 1-10
Front Matter....Pages 11-11
GAs: What Are They?....Pages 13-30
GAs: How Do They Work?....Pages 31-42
GAs: Why Do They Work?....Pages 43-53
GAs: Selected Topics....Pages 55-72
Front Matter....Pages 73-73
Binary or Float?....Pages 75-82
Fine Local Tuning....Pages 83-96
Handling Constraints....Pages 97-126
Evolution Strategies and Other Methods....Pages 127-138
Front Matter....Pages 139-139
The Transportation Problem....Pages 141-163
The Traveling Salesman Problem....Pages 165-191
Drawing Graphs, Scheduling, and Partitioning....Pages 193-214
Machine Learning....Pages 215-229
Conclusions....Pages 231-239
Back Matter....Pages 241-252
โฆ Subjects
Numerical Analysis; Programming Techniques; Software Engineering; Algorithms; Artificial Intelligence (incl. Robotics); Operation Research/Decision Theory
๐ SIMILAR VOLUMES
Zbigniew Michalewicz's Genetic Algorithms + Data Structures = Evolution Programs has three sections. The first section is a straightforward introduction to genetic algorithms. In the second section, Michalewicz describes how to apply genetic algorithms to numerical optimization. Michalewicz, who is