Computational intelligence

14 [2 x 7] Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end return to the starting city (the Travelling Salesman Problem). Suppose that in order to solve this problem we use a genetic algorithm, in which genes represent links between pairs of cities. For example, a link between London and Paris is represented by a single gene 'LP'. Let also assume that the direction in which we travel is not important so that LP = PL. Answer any TWO out of THREE: A. Describe a chromosome to solve this problem if the number of cities is 10. B. Suggest a crossover and mutation for this problem? C. Suggest a fitness function for this problem. 14 Inloction depends