The Genetic Algorithm is a Stochastic Hill climbing algorithm based upon the metaphor of population
genetics. It is a weak method that utilizes an objective function in order to guide performance. Here the objective function is the ONE MAX problem. This is a very simple example of what is called a symbolic regression problem. The goal is when given a random string of 0's and 1's, to optimize the count of the bits in the string. E.G. Produce a string of all ones. Brownlee, pp: 92-98.
Download the Ruby GA program that optimizes the performance function above. Plot the learning curve for the program. That is, for each generation plot the best value evolved so far. Describe how learning takes place here in terms of the graph. Does the learning process converge to the optimal function value? Describe
Recently Asked Questions
- What do the following have in common? The Parthenon Classical Greek sculpture Male Bees Sunflower Seeds 0, 1, 1, 2, 3, 5, 8, 13, Stradivari's violins Greek
- michaelangelo sistine chapel ceiling painting is one of the most famous examples of what painting
- You control K insects, each of which has a specific target ending location X k . No two insects may occupy the same square. In each time step all insects move