Issue No. 06 - June (1994 vol. 27)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.294849
<p>Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception.</p>
M. Srinivas and L. M. Patnaik, "Genetic algorithms: A Survey," in Computer, vol. 27, no. , pp. 17-26, 1994.