A local bank has its headquarters downtown (node 3) and has a daily collection of currencies from each branch to the main office. The bank has its own truck and a driver, but management has been unhappy with how long it has been taking to make these currency collections. The following figure shows a diagram with the miles between branches, and it takes only two minutes to collect currencies at each branch. Assume that during rush hour the delivery service speed averages 20 miles per hour.
Question 1.
How many possible routes are there for this problem?
Question 2.
Currently the driver has been using the route 3®2®5®7®6®1®4®3. What is the time for this tour, including the stop time at each of the six branches?
Question 3.
What is the nearest-neighbor heuristic solution to this problem starting at node 3 in terms of time and route?
Question 4.
Determine the optimal traveling salesman tour, total time to visit all branches.
