Documente Academic
Documente Profesional
Documente Cultură
CHAPTER 11
Network Models
ALTERNATIVE EXAMPLES
Alternative Example 11.1: Given the following network, perform the minimum-spanning tree technique to determine the best way to connect nodes on the network, while minimizing total distance.
We begin with node 1. Node 4 is the nearest node, and thus we connect node 1 to node 4. Given nodes 1 and 4, node 6 is the nearest, and we connect it to node 4. Now considering nodes 1, 4, and 6, we see that node 7 is the nearest to node 6 and we connect it. Node 5 is connected to node 7, and node 3 is connected to node 5 in the same way. Finally, node 2 is connected to node 1. Using the minimum-spanning tree technique, we can see that the total distance required to connect all nodes is 18. The following figure shows the results.
Page 1
Alternative Example 11.2: Given the network in the figure on the next page, determine the maximum amount that can flow through the network.
We begin this problem by putting the maximum flow of 4 through nodes 1, 2, and 6. This is shown in the following figure. The flows have been adjusted along this path.
Page 2
Next, we put the maximum flow of 4 units through nodes 1, 4, and 6. The adjusted network is shown below.
This process continues. We put a maximum of 2 units through nodes 1, 3, 5, and 6. The maximum amount that can flow through the network is 11. The figure below shows the final results.
Page 3
Page 4
The nearest node to node 1 is node 2. The distance is 50. Thus we put 50 in a box by node 2. The results of this step are shown in the following figure.
The next nearest node to node 1 is node 3. The distance is 100. Thus we put 100 in a box by node 3. The results of this step are shown in the following figure.
Page 5
The next-nearest node to node 1 is node 4. Actually, there are two paths to node 4 with the same distance of 250. One path is nodes 1, 3, 5, and 4. The other path is nodes 1, 2, and 4. We put 250 in a box by node 4. The results of this step are shown in the following figure.
The final step is to consider node 6. We can get to node 6 through node 5 (distance of 200 to node 1) and node 4 (distance of 250 to node 1). Going through node 5 will minimize the total distance. We can see that the shortest route is 300 (200 from node 5 to node 1 and 100 from node 5 to node 6). The results are shown in the following figure.
Page 6
11-9. One optimal solution is shown. Connect 13, 14, 36, 67, 12, 45, 79, 98, 910, 1011, 1113, 1314, and 1412. Alternate solutions can be found by substituting 34 for 14 and substituting 912 for 1314. Total distance = 45. 11-10. Flow Path 12578 1368 148 Total 11-11. (Cars/Hour) 2 2 1 5
Page 7
The shortest route is 13571013. The distance is 430 miles. 11-12. The minimal-spanning tree technique is needed to solve this problem. The minimum distance is 47 (4,700 feet). As you can see, the final solution has changed. 11-13. The maximal flow through the network is 7. This is higher by 2 cars from Problem 1110. The solution is given below. Flow Path 12578 1368 148 Total (Cars/Hour) 2 2 3 7
11-14. This is the only optimum solution to this problem (177 units of length).
Page 8
11-17. The solution to the minimal-spanning tree problem results in a minimum distance of 21 (2,100 yards). The final network follows. Figure for Problem 11-17
Page 9
11-18. If the distance between nodes 6 and 7 becomes 5, the minimum distance changes to 23 (2,300 yards). The final network follows. 12456 589 137 13 5 5 23 Another optimal solution exists. 11-19. The maximum number of cars that can flow from the hotel complex to Disney World is 13 (1,300 cars per hour). Solution to Problem 11-19 12 13 14 26 37 48 69 1011 710 810 911 Flow 3 8 2 3 8 2 3 10 8 2 3 Page 10
11-25. The shortest route from node 1 to node 16 is 74 kilometers. The solution along with the final network is shown in the following table and figure. 13 37 Value 15 11 Page 11
11-26. The impact of closing two nodes (nodes 7 and 8) is to increase the shortest route from 74 to 76 kilometers. Note that all paths into and from nodes 7 and 8 have their values changed to a very high relative number (10,000) to force these paths out of the final solution. The solution along with the final network is given below. Value 12 20 26 10 69 12 913 16 1316 18 Shortest path: 12691316 Total shortest distance: 76. Figure for Problem 11-26
Page 12
Page 13
Capacity 80 50 60 30 60 40 70 60 80 20 90 30 70 50 Flow 60 50 50 20 10
Flow 80 50 60 20 60 10 10 50 70 20 80 20 60 50
Path 1 2 5 8 1 3 6 8 1 4 7 8 1 2 3 4 7 6 5 8 1 4 3 5 6 8
11-34. QM for Windows indicates that total capacity is not affected. Other streets can be used to still accommodate 190 cars. Iteration 1 2 3 4 5 6 Path 1 2 5 8 1 4 7 8 1 3 4 7 6 8 1 2 3 5 6 8 1 3 5 8 1 4 3 5 8 Flow 60 50 30 20 20 10 Cumulative Flow 60 110 140 160 180 190
11-35. Using the shortest-route technique in QM for Windows, we find the minimum total distance to be 16 as shown in the table. Prof Piyu Mukherjee Dr JKPIM Page 14
11-36. a. The solution is 4,900 feet. This is almost 1 mile. The solution along with the final network is given below and on the next page. 13 37 712 1216 1620 2023 2325 Shortest path: 1371216202325 Total shortest distance: 49. Figure for Problem 11-36a Value 9 6 8 5 6 7 8
Page 15
Page 16
Page 17
Page 18