SCHEDULING: THE TRAVELING SALESMAN PROBLEM, math homework help
Anonymous

# Module 3 - Case

## SCHEDULING: THE TRAVELING SALESMAN PROBLEM

### Case Assignment

Part I

Here is a table of road miles (via most direct routes) and flight time among five cities.

Green cells (above diagonal): Highway miles

Blue cells (below diagonal): Flight time (hrs:mins)

A traveler wants to visit all these cities by car, beginning and ending in Dallas. Find the round trip with the fewest miles. To simplify your work, please use the one-letter codes instead of city names; for example, A=Dallas. Use the “by-hand” scheme described on the module Home page.

1. How many non-redundant routes are there, total? Use the formula.
2. List them.
3. Which is the shortest route?
 Help for 2, above.Here’s a partial solution. →The first figure is the flowchart used to find all possible routes, and the second figure is the list of routes and mirror routes used to find the redundancies.We’re giving you this head start because the purpose of the problem is not to waste hours, but rather to introduce you to the complexity of the general TSP. Five stops is near the upper practical limit for hand solutions. Anything larger requires a computer app.
 Help for 3, above.You may use the Excel app →TSP Route Calculator.xlsx

Part II

For all of its complexity, given more than four or five cities, the TSP may still be unable to deal with the real world. Consider the “too simple” problem of three cities, mentioned on the Module 3 Home page. A is an airline hub, such as Atlanta; B and C are satellite cities. There are flights between A and B, and also between A and C; but there are no flights between B and C, other than through A. Here’s the relevant information.

 Via Air: Flying Time (hrs:mins) Airfare A→B 1:30 \$500 B→A 1:30 \$420 A→C 0:50 \$380 C→A 0:50 \$300 C→B (via A) 2:30 (incl. layover at A) \$400 B→C (via A) 3:50 (incl. layover at B) \$590 Via rental car Driving time Mileage + drop-off fee B→C 3:45 \$120 C→B 3:45 \$100

A salesman wants to visit all three cities on one day, starting and finishing in A.

1. What’s his best plan, if he wants to minimize time?
2. What’s his best plan if he wants to minimize cost?

Part III

This part of the Case drives home the following point: The TSP may be easy to describe, but it’s hard to solve for other than simple problems. But in addition to that, it’s sometimes difficult to decide which data to use when setting up the problem.

1. Go to any online travel site. Fill in the following table for daily, weekday (M-F) one-way flights between New York and Los Angeles. Include data for at least two different airlines, two different classes of service (Coach/Tourist and Business/First), and two different departure times.

WEEKDAY FLIGHTS FROM JFK TO LAX (One way non-refundable)

 Airline Class Depart (EDT) Arrive (PDT) Time Enrt (HH:MM) Intermediate stops (if any) Price (undiscounted) 1 2 3 4 5 6 7 8
1. Assume you’re planning a business trip. What business-related factors would you consider, when choosing one of the flights listed above? Feel free to make up hypothetical factors affecting an imaginary business. (Have fun!)

### Assignment Expectations

1. There are no page limits. Write what you need to write, neither more nor less. Make each sentence count! (Having said that; it’s unlikely that one page would be enough, and very likely that eight pages would be too much.)
2. Ensure that your answer reflects your detailed understanding of the theory and techniques taught in this module.
3. References and citations are required. This requirement can be satisfied by citing the module Home page.
4. Follow the instructions in the Writing Style Guide.

## Final Answer

no there was nothing attached, please see aboveyou have just given me the information todaysee how many times I have requested the tables to be sentAnyhow I have finished before the timeI will inform customer support as well as all information was only sent from a few hours agoPlease let me know if there is anything needs to be changed or added. I will be also appreciated that you can let me know if there is any problem or you have not received the workGood luck in your study and if you need any further help in your assignments, please let me knowCan you please confirm if you have received the work? Once again, thanks for allowing me to help youRMESSAGE TO STUDYPOOL NO OUTLINE IS NEEDED AS IT IS A

Running head: C3

1

TOPIC
Student’s name
University Affiliation

2

Running head: C3
1.
Code

DISTANCE Dallas

St. Louis

New
Orleans

Memphis

Denver

A
_

B
631

C
505

D
453

E
795

A

Dallas

B
...

Robert__F (42830)
Carnegie Mellon University
Review

Anonymous
Top quality work from this tutor! I’ll be back!

Anonymous
It’s my second time using SP and the work has been great back to back :) The one and only resource on the Interwebs for the work that needs to be done!

Anonymous
Thanks, good work

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors