A high-performance hardware implementation of a survival-based genetic algorithm

Genetic algorithms were described by Holland in 1975 as a method of solving difficult optimization problems by means of simulated evolution. A major drawback of genetic algorithms is their slowness when emulated by software on conventional computers. Described is an adaptation of the original genetic algorithm based upon survival of the fittest, rather than selection of the fittest, that is advantageous to hardware implementation along with the architecture and implementation of a hardware framework that performs the functions of population storage, selection, crossover, mutation, fitness evaluation, and survival determination. Programming of the genetic algorithm machine is illustrated with the set coverage problem that exhibits a 2,200X speed-up over software emulation on a 100 MHz workstation.