Assume that you are a FedEx driver that needs to deliver packages to four different cities (A, B C and D). The distance between each city is shown below.
A to B: 190 miles
A to D: 157 miles
A to C: 124 miles
B to C: 126 miles
B to D: 155 miles
C to D: 179 miles
Q1. Determine the solution (shortest cumulative distance) using Brute Force method. There are six possible paths but not all of them are optimal.
Q2. Determine the solution using Nearest Neighbor Method. There is only one path.
Q3. Compare the results and discuss advantages and disadvantages of each method
Q4. When would you use Nearest Neighbor Method or The Brute Force Method? Is Nearest Neighbor Method always gives you an optimal path?