Simple genetic algorithm

TABLE I Example Individuals from a Simple Genetic Algorithm Population... 

Fonseca and Fleming (1993) proposed a modification of the simple genetic algorithm (SGA) at the selection level. The basic concepts of the proposed MOGA are the ranking based on the Pareto dominance and sharing function. The Pareto dominance-based rank is the same as one plus the number that certain individual dominates... 

Vose, M.D. (1999). The Simple Genetic Algorithm Foundations and Theory, MIT Press, Cambridge (MA), 251 p. 

In traditional simple genetic algorithm, the mutation/crossover operators are processed on the chromosome indiscriminately over the loci without making use of the loci statistics, which has been demonstrated to provide useful information on mutation operator [9]. In our mutation matrix formalism, the traditional genetic algorithm can... 

The following prescription allows a quick implementation of a simple genetic algorithm to a given optimization problem. 

A similar approach as for mutation can be adopted for recombining genetic strings. In the simple genetic algorithm that we want to model here, we define the recombination operation symmetrically in the two children produced. 

Vose, M.D. (1991) Modeling Simple Genetic Algorithms, in D. Whitley (ed.). Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo. 

---