Solved by: AllAcademicHelp.com
| October 29, 2018
Write my research paperPart IHere is a table of road miles (via most direct routes) and flight time among five cities.Green cells (above diagonal): Highway milesBlue 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.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.xlsxPart IIFor 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)AirfareA?B1:30$500B?A1:30$420A?C0:50$380C?A0:50$300C?B (via A)2:30 (incl. layover at A)$400B?C (via A)3:50 (incl. layover at B)$590 Via rental carDriving timeMileage + drop-off feeB?C3:45$120C?B3:45$100A salesman wants to visit all three cities on one day, starting and finishing in A.Part IIIThis 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.WEEKDAY FLIGHTS FROM JFK TO LAX (One way non-refundable)AirlineClassDepart (EDT)Arrive (PDT)Time Enrt (HH:MM)Intermediate stops (if any)Price (undiscounted)12345678Purchase the answer to view it©Copyright 2000-2018. All Rights Reserved. TermPaperChampions.com: The most reliable provider of custom academic papers. Our writers are here to help you complete papers from all disciplines and academic levels . You can always trust us to deliver.
Get a 15 % discount on an order above $ 50Use the following coupon code :tpc15
READY TO PLACE AN ORDER