Given A Fitness Function
Given A Fitness Function
of the fitness function for three iterations/generations. Use the bit inversion as the mutation operator
when generating the offspring.
Note: here you should apply the mutation operator instead of the crossover to find the
offspring for next generations
4000
3500
3000
Fitness Function
2500
2000
1500
1000
500
0
0 1 2 3 4 5 6
Generations
✏ Given a fitness function { f(x) = X2 + 1 } in the searching range of [0, 53], find the maximizing value
of the fitness function for three iterations/generations. Use the Order Changing (Swap Mutation) as the
mutation operator when generating the offspring.
Note: here you should apply the mutation operator instead of the crossover to find the
offspring for next generations
2500
2000
1500
1000
500
0
0 1 2 3 4 5 6
Generations