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.
How many non-redundant routes are there, total? Use the formula.
List them.
Which is the shortest route?
Help for 2, above.
Heres 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.Were 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. Heres the relevant information.
Via Air:
Flying Time (hrs:mins)
Airfare
AB
1:30
$500
BA
1:30
$420
AC
0:50
$380
CA
0:50
$300
CB (via A)
2:30 (incl. layover at A)
$400
BC (via A)
3:50 (incl. layover at B)
$590
Via rental car
Driving time
Mileage + drop-off fee
BC
3:45
$120
CB
3:45
$100
A salesman wants to visit all three cities on one day, starting and finishing in A.
Whats his best plan, if he wants to minimize time?
Whats 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 its hard to solve for other than simple problems. But in addition to that, its sometimes difficult to decide which data to use when setting up the problem.
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
8Assume youre 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!)
Are you looking for a similar paper or any other quality academic essay? Then look no further. Our research paper writing service is what you require. Our team of experienced writers is on standby to deliver to you an original paper as per your specified instructions with zero plagiarism guaranteed. This is the perfect way you can prepare your own unique academic paper and score the grades you deserve.
Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.
[order_calculator]