Editing Crossover (evolutionary algorithm) (section)

=== Uniform crossover===
In uniform crossover, typically, each bit is chosen from either parent with equal probability.<ref>{{Citation |last=Syswerda |first=Gilbert |title=Uniform crossover in genetic algorithms |date=1989 |work=Proceedings of the 3rd International Conference on Genetic Algorithms (ICGA) |pages=2–9 |editor-last=Schaffer |editor-first=J.D. |place=San Francisco |publisher=Morgan Kaufmann |isbn=1558600663 }}</ref> Other mixing ratios are sometimes used, resulting in offspring which inherit more genetic information from one parent than the other.
In a uniform crossover, we don’t divide the chromosome into segments, rather we treat each gene separately. In this, we essentially flip a coin for each chromosome to decide whether or not it will be included in the off-spring.