22. 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:

To From 1 2 3 4 5 6 7 8 1 999 19 57 51 49 4 12 92 2 19 999 51 10 53 25 80 53 3 57 51 999 49 18 30 6 47 4 51 10 49 999 50 11 91 38 5 49 53 18 50 999 68 62 9 6 4 25 30 11 68 999 48 94 7 12 80 6 91 62 48 999 9 8 92 53 47 38 9 94 9 999 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 . (Hint: Use the INDEX function to find the distance between locations and the alldifferent constraint in Solver . However, ensure that your solution goes back to the starting location.)