A salesperson wants to visit 25 cities while minimizing the total number of miles she must drive. Because she has studied computer science, she...
Question

# A salesperson wants to visit 25 cities while minimizing the total number of miles she must

drive. Because she has studied computer science, she decides to design an algorithm to

determine the optimal order in which to visit the cities to (1) keep her driving distance to a

minimum, and (2) visit each city exactly once. The algorithm that she has devised is the following: The computer first lists all possible ways to visit the 25 cities and then, for each one, determines the total mileage associated with that particular ordering. (Assume that the computer has access to data that gives the distances between all cities.) After determining the total mileage for each possible trip, the computer searches for the ordering with the minimum mileage and prints out the list of cities on that optimal route, that is, the order in which the salesperson should visit her destinations. If a computer could analyze 10,000,000 separate paths per second, how long would it take to determine the optimal route for visiting these 25 cities? On the basis of your answer, do you think this is a feasible algorithm? If it is not, can you think of a way to obtain a reasonable solution to this problem?

We need your expertise and would be very appreciative to help us get through this. We feel the only way to achieve visiting 25 cities is if they are approached within proximity of each other but thats as far as we can come up with. Could you please walk us through this problem. Thank you.

a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet

, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus
Step-by-step explanation

consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices

m risus an

1. ur laoreea. Fusce dui lectus, congue vel laoreet
2. pulvin, ultrices ac magna. Fusce dui lectus, congue ve
3. ur laoreeec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus
4. m ipsumdictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetu
5. ia pulving elit. Nam lacinia pulvinar tortor nec facilisis. Pell

ng elit. Nam lacinia pulvinamolestie consequs

nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fu

• or nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie cons,

consectetur adipiscing elit. Nam lacini, dictum viacinia pulvinar tortor nec facilisis.ocongue vel laoreet ac, diuscitur laoreet. Nam risus ante, dapib

usce dui lectus, congue vel laoreet ac, dictum v,necsitur laoreet. Nam risus ante, dapibusx, dictu

ongue vel laoreet ac, dictum vitae odio. Donec aliquet. Loreinentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molesti

itur laoree

lestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam la

490,808 students got unstuck by Course
Hero in the last week