MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

Genetic algorithms + data structures = evolution programs / Zbigniew Michalewicz.

By: Michalewicz, Zbigniew.
Material type: materialTypeLabelBookPublisher: Berlin ; New York : Springer-Verlag, c1996Edition: 3rd rev. and extended ed.Description: xx, 387 p. : ill. ; 24 cm.ISBN: 3540606769 .Subject(s): Evolutionary programming (Computer science) | Genetic algorithms | Data structures (Computer science)DDC classification: 005.1
Contents:
Part I: Genetic Algorithms -- GAs: What are they? -- GAs: How do they work? -- GAs: Why do they work? -- GAs: Selected Topics -- Part II: Numerical Optimization -- Binary or Float? -- Fine local tuning -- Handling constraints -- Evolution Strategies and Other methods -- Part III: Evolution Programs -- The Transportation Problem -- The Traveling Salesman Problem -- Machine Learning -- Evolutionary Programming and Genetic Programming -- A Hierarchy of Evolution Programs -- Evolution Programs and Heuristics -- Conclusions.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Lending 005.1 (Browse shelf(Opens below)) 1 Checked out 22/02/2022 00014552
Total holds: 0

Enhanced descriptions from Syndetics:

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.

Includes bibliographical references (pages 363-382) and index.

Part I: Genetic Algorithms -- GAs: What are they? -- GAs: How do they work? -- GAs: Why do they work? -- GAs: Selected Topics -- Part II: Numerical Optimization -- Binary or Float? -- Fine local tuning -- Handling constraints -- Evolution Strategies and Other methods -- Part III: Evolution Programs -- The Transportation Problem -- The Traveling Salesman Problem -- Machine Learning -- Evolutionary Programming and Genetic Programming -- A Hierarchy of Evolution Programs -- Evolution Programs and Heuristics -- Conclusions.

Table of contents provided by Syndetics

  • Introduction
  • Part I Genetic Algorithms
  • GAs: What Are They?
  • GAs: How Do They Work?
  • GAs: Why Do They Work?
  • GAs: Selected Topics
  • Part II Numerical Optimization. Binary or Float?
  • Fine Local Tuning
  • Handling Constraints
  • Evolution Strategies and Other Methods
  • Part III Evolution Programs. The Transportation Problem
  • The Traveling Salesman Problem
  • Machine Learning
  • Evolutionary Programming and Genetic Programming
  • A Hierarchy of Evolution Programs
  • Evolution Programs and Heuristics
  • Conclusions
  • Appendices
  • References
  • Index.

Powered by Koha