Abstract
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm being unable to find the global optimum. We present a new method of approximating the genetic similarity between two individuals using ancestry information. We define a new diversity-preserving selection scheme, based on standard tournament selection, which encourages genetically dissimilar individuals to undergo genetic operation. The new method is illustrated by assessing its performance in a well-known problem domain: algebraic symbolic regression.
Original language | English |
---|---|
Title of host publication | GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT II, PROCEEDINGS |
Editors | E CantuPaz, JA Foster, K Deb, LD Davis, R Roy, UM OReilly, HG Beyer, R Standish, G Kendall, S Wilson, M Hartman, J Wegener, D Dasgupta, MA Potter, AC Schultz, KA Dowsland, N Jonoska, J Miller |
Place of Publication | BERLIN |
Publisher | Springer |
Pages | 1804-1805 |
Number of pages | 2 |
ISBN (Print) | 3-540-40603-4 |
Publication status | Published - 2003 |
Event | 5th Annual Genetic and Evolutionary Computation Conference (GECCO 2003) - CHICAGO Duration: 12 Jul 2003 → 16 Jul 2003 |
Conference
Conference | 5th Annual Genetic and Evolutionary Computation Conference (GECCO 2003) |
---|---|
City | CHICAGO |
Period | 12/07/03 → 16/07/03 |