Question

Write pseudo code for the following conditions:

• Simulated Annealing with T=0 at all times and ommiting the termination test

• Genetic algorithm with population of size 1

• Modify the Hill Climbing algorithm so that it implements random restarts H.C

Answer 1

Answer:

1. Ignoring about the truth that termination step be triggered quickly, the search will be similar to the first choice, hill climbing it is because each downward successor will not be allowed/rejected with probability 1

2.If the population size is going to be 1, then two of the selected parents will be having the same individuals, crossover yields of an exact clone of the individuals then we have there is a very small chance/idea of mutation. Therefore this algorithm execute a random walk in the very space of individual.

3. Ignoring about the truth that termination step be triggered quickly, the search will be similar to a random walk it is because each successor will be accepted and allowed with the probability 1. Please keep in note that, in the case, a random walk is almost the equivalent to the depth first search.