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

. .

The post find the minimum distance tour. appeared first on Unified Papers.