An Introduction to Genetic Algorithms (Complex Adaptive Systems)

"This is a useful introduction to the subject and is well worth reading as an entry into evolutionary computing." -- Chris Robbins, Computing

Genetic algorithms have been used in science and engineering as adaptive algorithms for solving practical problems and as computational models of natural evolutionary systems. This brief, accessible introduction describes some of the most interesting research in the field and also enables readers to implement and experiment with genetic algorithms on their own. It focuses in depth on a small set of important and interesting topics--particularly in machine learning, scientific modeling, and artificial life--and reviews a broad span of research, including the work of Mitchell and her colleagues. The descriptions of applications and modeling projects stretch beyond the strict boundaries of computer science to include dynamical systems theory, game theory, molecular biology, ecology, evolutionary biology, and population genetics.

1. Not enough step by step prodecure especially at the beginning. Mitchell is too quick to start with the math formulas. It turns out that Genetic Algorithms are fairly straight forward and easy to follow, but you have to read this book twice before you "get it" because Mitchell clouds the discussion with proofs and mathematical representations of systems. It is tough to follow.

2. Mitchell does a poor job of selecting meaningful examples to illustrate the points. A nice simple set of examples where the average person easily picture the system would have been delightful. Instead this author chooses to illustrate the Genetic Algorithms through uncommon neural networks amoung other exotic applications. I found myself struggling to understand both the example (I didn't know a thing about neural networks!) and the genetic algorithm.

When buying an Introduction type book, I expected it to be more 'down to earth'. this book is for advanced minds!


An introduction and much more   January 25, 2004
dean_from_sa (Plano,TX)
9 out of 9 found this review helpful

First it must be said that the book is not an introduction that the non-scientist will easily understand. Some knowledge of computer programming is assumed. It acknowledges this in the last paragraph of the preface. Many of the notations in the book are unfamiliar to business or financial readers. There is no mathematics beyond algebra so the aforementioned prerequisites are the main hills to climb.

Mitchell's book is an overview of genetic algorithm analysis techniques as of 1996. The author gives a history of pre-computer evolutionary strategies and a summary of John Holland's pioneering work. A description of the basic terminology is presented and examples of problems solved using a GA (such as the prisoner's dilemma). The second chapter discusses evolving programs in Lisp and cellular automata. Also included in this chapter is a discussion of predicting dynamical systems. This was the section that has the most interest for me. Also interesting was the summary in this chapter about putting GAs into a neural network so that the ANNs could evolve.

The fifth chapter discusses when to employ a GA for maximum success. I appreciate the clearly thought out discussion of when to choose a GA for a problem. Sometimes authors of these types of books mimic the man with a hammer that thinks everything looks like a nail.


A Great Introduction to Genetic Algorithms   December 7, 2002
Brian K. Schmidt (Carlisle, MA United States)
9 out of 10 found this review helpful

This is a great place to start to learn about genetic algorithms. The writing is clear and not bogged down by jargon. The book is not overly technical; it is written for the layman and has a casual conversational style that is a pleasure to read.

About half of the book is devoted to presenting examples of studies that have used genetic algorithms. These examples are interesting in themselves and also serve to illustrate the variety of genetic approaches that are available. The book also presents conflicting points of view of experts about which algorithms work best and why. This is helpful in combatting the impression that a beginner sometimes gets that everything is simple and all the answers are known.