The Detrimentality of Crossover

The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the niche for the beneficial effect of crossover upon GA performance may be smaller than has traditionally been held. Based upon previous results on not-linear-separable problems we decided to explore this by comparing two test problem suites, one comprising nonrotated functions and the other comprising the same functions rotated by 45 degrees rendering them not-linear-separable. We find that for the difficult rotated functions the crossover operator was detrimental to the performance of the GA. We conjecture that what makes a problem difficult for the GA is complex and involves factors such as the degree of optimization at local minima due to crossover, the bias associated with the mutation operator and the Hamming Distances present in the individual problems due to the encoding. Finally, we tested our GA on a re...

• Type: Conference
• Year: 2007
• Where: AUSAI
• Authors: Andrew Czarn, Cara MacNish, Kaipillil Vijayan, Berwin A. Turlach
• Keywords: Artificial Intelligence, AUSAI 2007, Comprising Nonrotated Functions, Crossover, Difficult Rotated Functions