Genetic Algorithms in C++

A book/disk introduction to creating programs that allow computers to adapt to unexpected events. Covers basic theory of genetic algorithms (GAs); common evolutionary programming techniques; finite state machines; and optimization of input values through natural selection. Includes code examples demonstrating GA theory, common dynamic models, and representations of biological evolution. Assumes some programming experience. The accompanying disk contains source code. Annotation c. by Book News, Inc., Portland, Or.

This is a C++ programmer's introduction to genetic algorithms. The accompanying disk contains a fully functioning genetic algorithm system called FORGE (program FOR Genetic algorithm Experimentation). Ladd does not delve into the theory behind genetic algorithms, but instead focuses on implementation details. The software code is illustrated with a variety of problems, including the prisoner's dilemma, the traveling artist problem (a version of the traveling salesman problem in which the salesman does not know the distances between points), and maze traversal. Ladd also briefly discusses genetic programming.