Writer Choice

39772Assignment 1: Exploration Activity: I Found the Cheaper Route
The ability to understand how you can find the shortest route or cheapest rate for travel can be beneficial in real life. For this week’s Exploration Activity, you will create and solve a traveling salesperson problem.

To prepare for this Assignment:

Read the assigned sections from Chapter 14 from the course text.
Choose four cities you would like to visit.
Consult the Internet and use one-way airfares between cities to create a weighted graph.
By Day 6
Assignment (1–2 pages including the images):

Assume that you are located at A. Let B, C, D, and E represent each of the four cities you have chosen.

A-Upper Marlboro,MD( My home location)

B-Largo,MD
C-Landover,MD
D-Bowie, MD
E-Mitchelleville,MD

Use the Brute Force Method to find the optimal solution to visiting each of our chosen cities and returning home. Show all your work.
Use the Nearest Neighbor Method to approximate the optimal solution. Show all your work.
Identify how much money is being saved by using the optimal solution instead of the approximation. Show all your work.
Clearly label your work and identify each of the methods.
Put all of your work into one document.

References:
Blitzer, R. (2014). Thinking mathematically (6th ed.). Boston, MA: Pearson.

Chapter 14, “Graph Theory” (pp. 891)
Section 14.1, “Graphs, Paths, and Circuits” (pp. 892–899)
Section 14.2, “Euler Paths and Euler Circuits” (pp. 902–909)
Section 14.3, “Hamilton Paths and Hamilton Circuits” (pp. 914–920)
Section 14.4, “Trees” (pp. 924–929)