A residential moving company needs to move a family from city 1 to city 12 in Figure where the numbers on the arcs represents the driving distance in miles between cities.

a. Create a spreadsheet model for this problem.

b. What is the optimal solution?

c. Suppose that the moving company gets paid by the mile and, as a result, wants to determine the longest path from city 1 to city 12. What is the optimal solution?

d. Now suppose that travel is permissible in either direction between cities 6 and 9. Describe the optimal solution to thisproblem.

Transcribed Image Text:

459 370 621 180 420 430 440 813 543 541 515 290 768 423 12 312