- 1) Program a Genetic Algorithm to find an integer number between 0 and 31 that maximizes the function f(x)=x^2
- For the 1st generation, you need to print the process and result of selection, crossover, and mutation operation in detail; you need to show the process of each operation by printing corresponding integer value and bits (binary values).
- You also need to decide and print the crossover point and the mutation point.
- From the 2nd generation, you don’t have to print all results of selection, crossover, mutation operations, but you need to print the result of each generation until you find the answer.
You can use function itself as your fitness function. When your program produces an average of candidates is equal to or greater than 29, then you can accept it as a terminating condition.
Start your program with the following initialization.
- Population size: 8
- Crossover probability: 100%
- Mutation probability: 5%
2) Program a Genetic Algorithm to find an integer number between 0 and 31 that minimizes the function f(x)=(x-9)^2 . Design your program with the necessary parameters.
0 comments