#permutation-encoding

Question 1: Single choice

A genetic algorithm for an 8-city TSP stores each tour as the list of cities in visiting order (path representation). Single-point crossover after position 5 is applied to the parents $P_1 = (2, 7, 8, 4, 6, 3, 1, 5)$ and $P_2 = (1, 4, 7, 8, 6, 2, 3, 5)$ : each child takes the first five genes of one parent and the last three of the other. What do you get?

Neither child is a valid tour1
Both children are valid tours2
Only the child that starts with $P_1$ 's genes is valid3
Only the child that starts with $P_2$ 's genes is valid4

#permutation-encoding

Timed test