Chapter 14.3, Problem 66E

In this group exercise, you will create and solve a traveling salesperson problem similar to Exercises 39 and 40. Consult the graph given for these exercises as you work on this activity.

a. Group members should agree on four cities to be visited,

b. As shown in the graph for Exercises 39 and 40, assume that you are located at A. Let B, C, D, and E represent each of the four cities you have agreed upon Consult the Internet and use one-way airfares between cities to create a weighted graph.

c. As you did in Exercise 39, use the Brute Force Method to find the optimal solution to visiting each of your chosen cities and returning home.

d. As you did in Exercise 40, use the Nearest Neighbor Method to approximate the optimal solution How much money does the group save using the optimal solution instead of the approximation?