All Categories
It might be simple, but it's not easy. Computer scientist Michael D. Vose takes a rigorous look at The Simple Genetic Algorithm and shows the state of our knowledge in a book appropriate for advanced undergraduates, graduate students, and professionals. Vose has decided to approach his subject as a mathematical object, keeping his discussion to a minimum and relying on mathematical demonstrations of what has been proven about this powerful genetic search. This approach maximizes the book's utility for its scope of readers; since each chapter builds on the material before, it makes a good teaching tool, but it is still a useful reference as the indexing helps the professional find proofs quickly. Covering the basics of random heuristic searching and the nature of the algorithm, the book moves on to computing, transient and asymptotic behavior, models, and schemata. Cutting all of the material down to the basic provable theorems is not, as Vose admits, without problems: any speculation beyond these stripped-down proofs is left to the imaginative reader. But the intrepid explorer couldn't ask for firmer ground from which to launch flights of discovery, and genetic computation currently offers the widest frontiers. --Rob Lightner