Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end traveler returns 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 Delhi and Mumbai is represented by a single gene DM : Also assume that the direction in which we travel is not important, so that DM = MD .

i) How many genes will be used in a chromosome of each individual if the number of cities is 10?

ii) How many genes will there be in the alphabet of the algorithm?

Sure, let's break it down:

i) In the context of the traveling salesman problem using a genetic algorithm, each chromosome represents a potential solution, i.e., a sequence of cities to be visited. If there are 10 cities, the number of genes in a chromosome would ____ ____ _________ _______ _____ _____ ___ ___ _________ ___ _____ ______.
________ _______ __________ __________ ___ _____.
______ ________ _____ __________ ____ __________ _____ ____ ___.
_____ ____ _________ ________ _______ _______ __________ __________ _____ ________.
___ _________ __________ __________ _______ ________ _____ _________ _______ ________ ___.
__________ _____ ______ ____ ____ _______ __________ _________ ________ _____ _________ ____.
_________ __________ ___ ___ ______ ____ __________ __________ __________ ____ ___.
________ ____ ______ _________ ________ ________ _____ _______ _______.
____ __________ ________ __________ ____ ______ ___ ___ __________ _________.
_______ ______ ___ ________ ___ _____ ___ _____.
___ __________ _______ ____ _______ ________.
__________ ________ ______ ___ __________ _________ __________ ________ ______ _______ ____.
_________ ______ ____ ________ __________ _______ __________ _______ ______ __________ ___.
________ _____ _______ ____ __________ _________.
___ _________ ___.
Get Full Answer on WhatsApp