Skip to Main Content
The behavior of the genetic algorithm (GA), a popular approach to search and optimization problems, is known to depend, among other factors, on the fitness function formula, the recombination operator, and the mutation operator. What has received less attention is the impact of the mating strategy that selects the chromosomes to be paired for recombination. Existing GA implementations mostly choose them probabilistically, according to their fitness function values, but we show that more sophisticated mating strategies can not only accelerate the search, but perhaps even improve the quality of the GA-generated solution. In our implementation, we took inspiration from the "opposites-attract” principle that is so common in nature. As a testbed, we chose the problem of 1-NN classifier tuning where genetic solutions have been employed before, and are thus well-understood by the research community. We propose three "instinct-based” mating strategies and experimentally investigate their behaviors.
Knowledge and Data Engineering, IEEE Transactions on (Volume:22 , Issue: 12 )
Date of Publication: Dec. 2010