Abstract
Fine-honing the crossover operator to produce higher fitness children is shown to result in improved genetic search. To illustrate this, two new general-purpose crossover operators are described. These operators require more computation time than traditional crossover operators, but the number of fitness evaluations and the overall amount of time spent by the genetic algorithm (to obtain solutions of desired near-optimal quality) is reduced significantly.
Original language | English (US) |
---|---|
Pages | 1542-1549 |
Number of pages | 8 |
DOIs | |
State | Published - 1999 |
Externally published | Yes |
Event | 1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States Duration: Jul 6 1999 → Jul 9 1999 |
Other
Other | 1999 Congress on Evolutionary Computation, CEC 1999 |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 7/6/99 → 7/9/99 |
ASJC Scopus subject areas
- Computational Mathematics