Premium Members Get 10% Off and Earn Rewards Find Out More
Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

by Zbigniew Michalewicz
Alternative view 1 of Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
Alternative view 2 of Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
Add to Wishlist
ISBN-10:
3540606769
ISBN-13:
9783540606765
Pub. Date:
03/21/1996
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540606769
ISBN-13:
9783540606765
Pub. Date:
03/21/1996
Publisher:
Springer Berlin Heidelberg
Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

by Zbigniew Michalewicz

Overview

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.

Product Details

ISBN-13: 9783540606765
Publisher: Springer Berlin Heidelberg
Publication date: 03/21/1996
Edition description: 3rd, rev. and extended ed. 1996
Pages: 387
Product dimensions: 0.00(w) x 0.00(h) x 0.04(d)

Table of Contents

1 GAs: What Are They?.- 2 GAs: How Do They Work?.- 3 GAs: Why Do They Work?.- 4 GAs: Selected Topics.- 5 Binary or Float?.- 6 Fine Local Tuning.- 7 Handling Constraints.- 8 Evolution Strategies and Other Methods.- 9 The Transportation Problem.- 10 The Traveling Salesman Problem.- 11 Evolution Programs for Various Discrete Problems.- 12 Machine Learning.- 13 Evolutionary Programming and Genetic Programming.- 14 A Hierarchy of Evolution Programs.- 15 Evolution Programs and Heuristics.- 16 Conclusions.- Appendix A.- Appendix B.- Appendix C.- Appendix D.- References.
From the B&N Reads Blog
Page 1 of

Related Subjects

Computers
Science & Technology
Engineering
Technology
Computer Programming
Artificial Intelligence (AI)
Robotics & Artificial Intelligence
Biology & Life Sciences
Software Engineering
Genetics
Evolutionary Computation & Genetic Algorithms
Genetics - General and Miscellaneous
Programming - General & Miscellaneous
General Software Engineering
Data structures->Software engineering
Computers
Science & Technology
Engineering
Technology
Computer Programming
Artificial Intelligence (AI)
Robotics & Artificial Intelligence
Biology & Life Sciences
Software Engineering
Genetics
Evolutionary Computation & Genetic Algorithms
Genetics - General and Miscellaneous

Customer Reviews