In one point crossover, a random crossover point is selected, and the halves of the two parents are swapped to generate new off-springs.

In uniform crossover, each bit is chosen from either parent with equal probability. Just like flipping a coin to decide whether a bit will be included in the offspring.

In bit flip mutation one or more bits are selected, and their values are mutated i.e. we change 1s to 0s and vice versa.

The fitness function simply defined is a function which takes a candidate solution to the problem as input and produces as output how “fit” our how “good” the solution is with respect to the problem in consideration.

https://www.geeksforgeeks.org/mutation-algorithms-for-string-manipulation-ga/ https://www.tutorialspoint.com/genetic_algorithms/genetic_algorithms_quick_guide.htm