TC6544 Assignment 7
TC6544 Assignment 7
Assignment 7
Figure 1
Trace the tabu search algorithm (to minimize the total distance traveled) for ten iterations.
Note that:
• the tabu size is set to 2.
• neighbor solutions are all possible routes that can be obtained through adjacent
pairwise interchanges.
• The aspiration criterion allows a move, even if it is tabu, resulting in an objective
value better than the current best solution.
2. Genetic Algorithm
a) Explain the effect of selection, crossover and mutation in evolutionary computation.
How is the population affected by the use of each one of these operators? What happens
if you use a relatively high rate of mutation? What is a possible problem that might
occur in an algorithm that uses elitism?
b) Let the fitness f of bit string x with length L=4 to be the integer represented by the
binary number x (e.g. f(0011) = 3, f(1111) = 15). Assume that the current population
is:
1010
1000
0100
0110
1100
ii. If mutation has a rate other than 0, could the GA possibly generate the fittest
individual? Give an example.
f(<bitstring>) = number of 1’s in the bitstring where both adjacent bits are 0’s
Start with the initial population below and show what the next two generations might
look like. Briefly explain your reasoning.
Initial Population
011110110
011001011
101101110
000010101
d) Consider a function maximization application of a GA. Suppose the 5 chromosomes at
a given generation have fitness values listed below.
f(x1) = 55
f(x2) = 24
f(x3) = 8
f(x4) = 19
f(x5) = 42