# Question

You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns.

(a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles.

(b) Use the algorithm described in Sec. 10.3 to solve this shortestpath problem.

(c) Formulate and solve a spreadsheet model for this problem.

(d) If each number in the table represented your cost (in dollars) for driving your car from one town to the next, would the answer in part (b) or (c) now give your minimum cost route?

(e) If each number in the table represented your time (in minutes) for driving your car from one town to the next, would the answer in part (b) or (c) now give your minimum time route?

(a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles.

(b) Use the algorithm described in Sec. 10.3 to solve this shortestpath problem.

(c) Formulate and solve a spreadsheet model for this problem.

(d) If each number in the table represented your cost (in dollars) for driving your car from one town to the next, would the answer in part (b) or (c) now give your minimum cost route?

(e) If each number in the table represented your time (in minutes) for driving your car from one town to the next, would the answer in part (b) or (c) now give your minimum time route?

## Answer to relevant Questions

A company will be producing the same new product at two different factories, and then the product must be shipped to two warehouses. Factory 1 can send an unlimited amount by rail to warehouse 1 only, whereas factory 2 can ...Reconsider the minimum cost flow problem formulated in Prob. 10.6-2. The Tinker Construction Company is ready to begin a project that must be completed in 12 months. This project has four activities (A, B, C, D) with the project network shown next. The project manager, Sean Murphy, has ...Use the algorithm described in Sec. 10.3 to find the shortest path through each of the following networks, where the numbers represent actual distances between the corresponding nodes. (a) (b) Re-solve the Local Job Shop employment scheduling problem (Example 4) when the total cost of changing the level of employment from one season to the next is changed to $100 times the square of the difference in employment ...Post your question

0