Willie Lowman is a salesman who lives in Boston. He needs to visit each of the cities listed in Figure 8.33 (see the file Traveling Salesperson.xlsx) and then return to Boston. In what order should...

Willie Lowman is a salesman who lives in Boston. He needs to visit each of the cities listed in Figure 8.33 (see the file Traveling Salesperson.xlsx) and then return to Boston. In what order should Willie visit the cities to minimize the total distance traveled?

Objective To use Evolutionary Solver, with a special kind of constraint, to find the shortest route that starts and ends in Boston and visits each of the other 10 cities exactly once

if Willie is flying from city to city, the costs of the various flights is the more relevant “distance” measure, and as we all know, these costs are not necessarily proportional to the actual distances.