Genetic algorithms (GAs) are a class of programs that emulate the search processes of natural genetic evolution. This article reviews GA technology. The review begins by recasting search as a process of sampling points from an unknown space. With this “black-box” view of search, the simple mechanics of the GA are shown to have powerful effects. A review of basic GA mechanics and theory is followed by an overview of more advanced GA techniques. Final comments address future directions for GAs and for general evolving systems research.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert E. Smith, Robert E. Smith, } "Genetic and evolutionary systems", Proc. SPIE 10277, Adaptive Computing: Mathematics, Electronics, and Optics: A Critical Review, 102770A (1 March 1994); doi: 10.1117/12.171199; https://doi.org/10.1117/12.171199

Back to Top