Question: The traveling salesperson problem involves finding an optimal route (called a tour) that visits each of n cities exactly once and returns to the start.

The traveling salesperson problem involves finding an optimal route (called a tour) that visits each of n cities exactly once and returns to the start. For example, suppose the distances between medical offices for a pharmaceutical representative are:
The traveling salesperson problem involves finding an optimal route (called

Note that the distance from one location to itself is an arbitrarily high number, 999. An example of a tour is 1-4-2-7-8-3-6-5-1. The total distance traveled would be 51 + 10 + 80 + 9 + 47 + 30 + 68 + 49 = 344. The objective is to find the minimum distance tour. Set up and solve this problem using Evolutionary Solver.

8237-8 9543 9-24 3 289 9 7 2069-6 018 3 9380 4515 9-8-2-9 9 T4-1 99 514 0118 5193 1 355 3 413 8-0-6-4' 367 51 3 971-9 1-5-5-4 5-45-4 22 | 12-91 ro 1 2 3 4 5678

Step by Step Solution

3.34 Rating (169 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Model Xi integer X1X8 must be al... View full answer

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

Document Format (1 attachment)

Word file Icon

749-M-S-S-D (3368).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!