GAs are stochastic search algorithms based on the mechanism of natural selection and natural genetics. GA, differing from conventional search techniques, start with an initial set of random solutions called population satisfying boundary and/or system constraints to the problem. Each individual in the population is called a chromosome (or individual), representing a solution to the problem at hand. Chromosome is a string of symbols usually, but not necessarily, a binary bit string. The chromosomes evolve through successive iterations called generations. During each generation, the chromosomes are evaluated, using some measures of fitness. To create the next generation, new chromosomes, called offspring, are formed by either merging two chromosomes from current generation using a crossover operator or modifying a chromosome using a mutation operator. A new generation is formed by selection, according to the fitness values, some of the parents and offspring, and rejecting others so as to keep the population size constant. Fitter chromosomes have higher probabilities of being selected. After several generations, the algorithms converge to the best chromosome, which hopefully represents the optimum or suboptimal solution to the problem. 4.1 General Structure of a Genetic Algorithm In general, a GA has five basic components: 1. A genetic representation of potential solutions to the problem. 2. A way to create a population (an initial set of potential solutions).
CITATION STYLE
Kubat, M. (2017). The Genetic Algorithm. In An Introduction to Machine Learning (pp. 309–329). Springer International Publishing. https://doi.org/10.1007/978-3-319-63913-0_16
Mendeley helps you to discover research relevant for your work.