A residential moving company needs to move a family from city 1 to city 12 in the figure below where the numbers on the arcs represent the driving distance in miles between cities. 838 540 205 10 265 92 1 455 265 11 395 8 3 398 434 460 287 320 445 582 4 12 415 566 646 793 9 7 568 (a) Create a spreadsheet model for this problem. What is the optimal solution? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.) (b) Suppose 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? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.) (c) Now suppose travel is permissible in either direction between cities 6 and 9. Describe the optimal solution to this problem. For the shortest route, the total distance traveled ---Select-- V. For the longest route, the total distance traveled ---Select--

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section6.5: Set-covering And Location-assignment Models
Problem 35P
icon
Related questions
Question
A residential moving company needs to move family from city 1 to city 12 in the figure below where the numbers on the arcs represent the driving distance in miles between cities.
838
540
205
455
265
92
265
11
395
398
434
460
287
320
445
582
12
415
566
646
793
568
i
(a) Create a spreadsheet model for this problem. What is the optimal solution? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.)
(b) Suppose 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? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.)
(c) Now suppose travel is permissible in either direction between cities 6 and 9. Describe the optimal solution to this problem.
For the shortest route, the total distance traveled ---Select---
. For the longest route, the total distance traveled ---Select---
Transcribed Image Text:A residential moving company needs to move family from city 1 to city 12 in the figure below where the numbers on the arcs represent the driving distance in miles between cities. 838 540 205 455 265 92 265 11 395 398 434 460 287 320 445 582 12 415 566 646 793 568 i (a) Create a spreadsheet model for this problem. What is the optimal solution? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.) (b) Suppose 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? (Enter your answer as an ordered comma-separated list of the city numbers of the optimal path.) (c) Now suppose travel is permissible in either direction between cities 6 and 9. Describe the optimal solution to this problem. For the shortest route, the total distance traveled ---Select--- . For the longest route, the total distance traveled ---Select---
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 10 images

Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,