Whitley D. A Genetic Algorithm Tutorial

Tutorial, Computer Science Department, Colorado State University, Statistics and Computing, 1994, 37 p.Encodings and Optimization Problems.
How Hard is Hard?
The Canonical Genetic Algorithm.
Why does it work? Search Spaces as Hypercubes.
Two Views of Hyperplane Sampling.
The Schema Theorem.
The Case for Binary Alphabets.
Criticisms of the Schema Theorem.
An Executable Model of the Genetic Algorithm.
Other Models of Evolutionary Computation.
Hill-climbers or Hyperplane Samplers.
Parallel Genetic Algorithms.