Evolutionary Computing

Assignment3:
Symmetric Traveling Salesman: pdf

Assignment2:
Graphs:
(Large Params: xover: 0.99, mutation: 0.01)
(Average Params: xover: 0.67, mutation: 0.001)
(Small Params: xover: 0.2, mutation: 0.0001)
DeJong f1:

DeJong f2:

DeJong f3:

DeJong f4:


Assignment1:
Source: Assignment1
Description:
For both black box problems I used elitism selection set to the top 10 percent of the population with a mutation rate of 1 percent and population size of 100.
For the simple eval black box problem the GA found many optimal solutions to the problem. It took the GA about 11 generations to find an optimal solution with a fitness of 64.
For the more complex eval1 problem that took much longer to evaluate the GA found an optimal solution in ___ generations.
As there were many solutions with a fitness of 64 and all of the solutions differed greatly; if there was a better s olution the GA would have a difficult time of finding the correct hill. Assignment0:
Source: Assignment0
Description: