Question: 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

Computational intelligence 14 [2 x 7] Consider the problem of finding

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

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

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)....

Please solve the handwriting clearly 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...

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)....

( 0 . 5 Points ) a . 2 4 b . 5 4 7 . C . 1 4 . 4 . d . 4 9 . 2 2 . Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end...

I will provide below the original problem and the code I've written. What is my code doing wrong? Traveling Salesperson Problem - - Held - Karp Algorithm This exercise is about the Traveling...

This is a Dijsktra Algorithm Project, I have some errors that prevent me from running the program. *an expert said I did not have the resources files posted so here it is. There also some new...

Code in VBA please, will upvote if done correctly Based on EX_2, how can you improve the nearest neighbor Heuristic algorithm? First allow user to identify starting city (iStart) Loop through all...

Alexis Tyler is a star player for the Salt Lake City Lake Monsters and is ranked among the best player in the league. Alexis is wrapping up the "contract year" - the final playing season before a...

An insulated rigid tank that contains 1 kg of CO2 at 100 kPa and 25oC and is connected to another insulated rigid tank that contains 1 kg of H2 at 200 kPa and 500oC. The valve connecting the two...

Question content area top Part 1 You purchase a pizza oven that is expected to last 1 0 years for $ 1 5 , 0 0 0 . How do you account for the economic cost of the oven? Question content area bottom...

1. Chips numbered 1 to 1,000 are placed in a bag. We reach into the bag 50 times. Each time we draw out two chips, write down the sum of the numbers on them and set the chips aside so they can't be...