I'm trying to do a homework problem which references "disruption" in Genetic Algorithms.
True or false? For 1-point and 2-point crossover, the schemata which have bits that are close together on the string encoding are more likely to be disrupted by crossover.
I think that it is referring to is the creation of children distinct from their parents.
For example, combining the following two parents at a single crossover point at the second digit would just create the same parents again. Thus, no disruption would occur.
p1: 00000 p2: 00001
However, combining the following two parents at a single crossover point at the second digit would create some disruption.
p1: 00000 p2: 01001 c1: 01000 c2: 00001
By intuition, I would measure disruption as the number of bits that are different in a child as compared to the two parents. However, I have no formal definitions of this, despite turning to Google. The closest I've come is to Holland's Schema Theorem, which I think is related, but I would still like a definition or an explanatory reference.