Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
  • Genetic Algorithms + Data Structures = Evolution Programs / Edition 3
  • Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

Genetic Algorithms + Data Structures = Evolution Programs / Edition 3

by Zbigniew Michalewicz
     
 

ISBN-10: 3540606769

ISBN-13: 9783540606765

Pub. Date: 11/26/1998

Publisher: Springer Berlin Heidelberg

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…  See more details below

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 aim of this book is to talk about the field of evolutionary computation in simple terms, and discuss the simplicity and elegance of its methods on many interesting test cases. The book may serve as a guide to writing an evolution program, and to making this an enjoyable experience. It is self-contained and the only prerequisite is basic undergraduate mathematics. Aimed at researchers, practitioners, and graduate students, it may serve as a text for advanced courses in computer science and artificial intelligence, operations research, and engineering. This third edition has been substantially revised and extended. Three new chapters discuss the recent paradigm of genetic programming, heuristic methods and constraint handling, and current directions of research. Additional appendices contain test functions for experiments with evolutionary techniques and discuss possible projects for use in a project-oriented course.

Read More

Product Details

ISBN-13:
9783540606765
Publisher:
Springer Berlin Heidelberg
Publication date:
11/26/1998
Edition description:
3rd, rev. and extended ed. 1996. Corr. 2nd printing 1998
Pages:
408
Sales rank:
1,072,666
Product dimensions:
0.00(w) x 0.00(h) x 0.04(d)

Table of Contents

Introduction1
1GAs: What Are They?13
2GAs: How Do They Work?33
3GAs: Why Do They Work?45
4GAs: Selected Topics57
5Binary or Float?97
6Fine Local Tuning107
7Handling Constraints121
8Evolution Strategies and Other Methods159
9The Transportation Problem181
10The Traveling Salesman Problem209
11Evolution Programs for Various Discrete Problems239
12Machine Learning267
13Evolutionary Programming and Genetic Programming283
14A Hierarchy of Evolution Programs289
15Evolution Programs and Heuristics307
16Conclusions329
Appendix A337
Appendix B349
Appendix C353
Appendix D359
References363
Index383

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >