Genetic Algorithms + Data Structures = Evolution Programs
Authors: Michalewicz, Zbigniew
Free PreviewBuy this book
- About this book
-
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.
- Table of contents (17 chapters)
-
-
Introduction
Pages 1-10
-
GAs: What Are They?
Pages 13-31
-
GAs: How Do They Work?
Pages 33-44
-
GAs: Why Do They Work?
Pages 45-55
-
GAs: Selected Topics
Pages 57-93
-
Table of contents (17 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Genetic Algorithms + Data Structures = Evolution Programs
- Authors
-
- Zbigniew Michalewicz
- Copyright
- 1996
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-662-03315-9
- DOI
- 10.1007/978-3-662-03315-9
- Hardcover ISBN
- 978-3-540-60676-5
- Softcover ISBN
- 978-3-642-08233-7
- Edition Number
- 3
- Number of Pages
- XX, 387
- Number of Illustrations
- 14 b/w illustrations
- Topics
