You are to write a genetic algorithm program to find solutions to the following problems:
Each of the encodings can use a simple, signed integer binary representation for the values. For example, the encoding for the first function could be three 10-bit numbers (nine bits to represent values between 0 and 512 plus one bit for the sign) concatenated together to form a 30-bit string. The second function could be two 12-bit numbers (11 bits for the value and one for the sign) concatenated together.
You do not need to implement mutation.
Your program should output the relevant statistics for each generation. Some interesting statistics include the minimum, maximum, average, and standard deviation for the population.
In addition to the source code for your program, and the output from your executions, you should also turn in a write-up describing your experiments. What population size did you choose? How well does the genetic algorithm perform? How many generations does it take to find a good solution? How does the performance of the program change with population size?
This assignment is due Tues, April 28.
Unlike the previous assignment, this is not a group project. Each of you should work independently.