question archive 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)
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)
Subject:Computer SciencePrice: Bought3
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 Rawalpindi and Lahore is represented by a single gene 'RL'. Let also assume that the direction in which we travel is not important, so that RL = LR. a) How many genes will be used in a chromosome of each individual if the number of cities is 12? b) Show all 12 cities in binary number system using minimum number of binary bits. as shown in the table below. City Binary rep. 1 010101 2 101010 3 001100 c) Create a sample binary chromosome structure to represent candidate solution. having number of genes you found in the above solution.
