Genetic algorithms + data structures evolution programs

書誌事項

Genetic algorithms + data structures = evolution programs

Zbigniew Michalewicz

Springer-Verlag, 1996

3rd, rev. and extended ed

  • : hardcover
  • : [pbk.]
タイトル別名

Genetic algorithms plus data structures equals evolution programs

大学図書館所蔵 件 / 全66件

この図書・雑誌をさがす

注記

Includes bibliographical references (p. [363]-382) and index

内容説明・目次

内容説明

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.

目次

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.

「Nielsen BookData」 より

詳細情報

ページトップへ

AltStyle によって変換されたページ (->オリジナル) /