Reeves (mathematical and information sciences, Coventry U., UK) and Rowe (computer science, U. of Birmingham, UK) describe the traditional theory of schemata and the implications of the no-free-lunch theorem before turning to the different perspectives on genetic algorithms, including Markov chain theory, and the dynamic and macroscopic behavior of genetic algorithms. Two chapters are devoted to statistical methods in experimental design and in heuristic search methods