Name
Abstract | ||
|---|---|---|
The crossover operation is characteristic of genetic algorithms (GAs). This paper analyzes the crossover effect in GAs. We start with two bits, that is the minimum chromosome length to crossover. We compare one operator GAs, using only selection, and two operators GAs by selection and crossover with respect to the expected quality and speed of the convergence. First, we analyse the case of two individuals, that is the minimum population size, by a Markov chain. We show the boundary in the fitness assignment cube where crossover improves the absorption probability to the optimum. We also show that crossover always speeds up convergence. Second, we analyse the larger population case by numerically solving the difference equations. We show a boundary where the crossover speeds up convergence. Normal medium sized GAs can be positioned between these two extremes |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/ICEC.1994.349989 | International Conference on Evolutionary Computation |
Keywords | Field | DocType |
Markov processes,convergence,genetic algorithms,optimisation,Markov chain,absorption probability,boundary,convergence,crossover,crossover operation,fitness assignment cube,genetic algorithms,optimization method | Convergence (routing),Population,Crossover,Markov process,Markov chain,Artificial intelligence,Operator (computer programming),Crossover effects,Mathematics,Machine learning,Genetic algorithm | Conference |
Citations | PageRank | References |
3 | 0.50 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Yamamura | 1 | 242 | 37.62 |
| Hiroshi Satoh | 2 | 4 | 1.66 |
| Shigenobu Kobayashi | 3 | 791 | 98.15 |