Ss on objectives a i ! she end of this chapter, the student should be e ee fF to: 1 define a network model + construct a network; and discuss the minimal-spanning tree technique, maximal flow tech path technique. lechnique, and shortest VERVIEW ata collected from various sources are arranged and Presented in various ways to facilitate alyis and evaluation. They can be described and presented in the form of text, tables or sais networks, or statistics. A network model is an analytical approach to presenting, ing, and solving the relationships of data using nodes that are connected by lines, The n tree is an example of a network. A network consists of a node, which is represented by icine and an edge, which is represented by a line. Thischapter discusses the following network models: | Minimal-spanning tree technique 2 Maximal flow technique * Shortest path technique ——— alatesTYAS 136, ov Sancr A Qe enon ING TREE TECHNIQUE esigned © connect all nodes ince. Utility Companies Ra = MINIMAL-SPANNI : ia jista’ ne oem ren ime Pan they plan to install wi a network and, at the same Himes ot fl tel ae 10 ina ie ‘ a and teleport a i cular af an be More than one optim, Connect cables that connect ‘all houses ao re i mare than ene om e mc ides in a network is the optimal $¢ Te near nal a : odes ina network f ssa rae unconnected nodes have equal di te pegte Be ancinc SS co nvolve “ rattowing, are tne SPS a : The ota nore sing v0! lines. u 1. Construct a networ 2 Select any node in the netwo" aad ted node t he nearest node. cee nected FE | c G 4 D F 2 E i G 8 F H Required. Using the minimal- ing tree tec nimum distane is spanning ti chnique, determine the mii i ‘imum will connect the eight houses.eady, namely, houses # RB and p, the distance is 6 kilomete, ‘This time, there are th E,FG,and H. From lone ee Pian z ‘The unconnected houses an ak G, the distances a ee the shortest distance that oi Fr Dt ithe 6 kilometer distances in this case Deere eee 4B, and houses C and F. This sg Seta be ra eoltion The connection between houses 4 that is, .e op i be more than one 0} 2 statin where ce The hid eration appears 35 lO and Bis select connected alr tween houses A ‘and B, houses C an‘ This time, the unconnected houses are E, F, G, and H. House E can be connected to houses B and C, with distances of 6 and 10 kilometers, respectively. House F can be connected to houses Cand D, with distances of 6 and 12 kilometers, respectively. House G can be connected to house whose distance is 1 kilometers, House H, at this point, cannot be connected yet. The shortest distance is 6 kilometers. However, there are tw ance’ that is, hogan ‘0 connections with such dist: B to E and houses C to R. Houses B and E i Beds are selected. Hence, the fourth iteration appears as| 2 ak a ae 140 OSE Geren reo ‘or substance that can fig, flow, MAXIMAL FLOW TECHNIQUE The maximal flow tect determines the maximum quantity O° through a network. Flow through which & quantity enters and gets from a certain ‘node. This tool ca be user the maximum number of vehic | that pass through The following are # 1 Construct a network: 2, Select any complete 3. Determine the maximw) 4, Adjust the flow of the selected 5, Repeat steps 2,3,and4 ‘until an increase i6 requested by the Department of Public Works and High sing the maximum number wa Jenny Consultancy has been (DPWH) to develop Toad system of a small city by deter following data: that can pass through the system. The study reveals the To Street Number of Cars per Hour | th with no outflow equal to Zero. rough the path. y that can pass 1m quantit path. no longer possible. alo ala a i Blalalelololo H Soles a) rio @ |i o rielalalelalale “4 alo vV42_ Moccinunr Sounces A QuaviTanive ArPRoxcH 10 Decision MAKING ota path, the following Adjust the flow of the selected path. To adjust the selected are performed: a. Subtract the maximum quantity determined in step pe sources of the pa from all # 5 nations of the path, all the desti Ream s aie 30 b. Add the maximum quantity determined in step ne outflows, the adjus When subtracting the maximum quantity from. the sour appears as follows: Node 1 to node 2: 30 - 20 = 10 Node 2 to node 6: 20 - 20 =0 flows, the adjustment appears or in When adding the maximum quantity to the destinations as follows: Node 1 to node 2: 10 + 20 Node 2 to node 6: 20 + 20 = 40 path 1 - 2 - 6 will have the following revised quantity in the paths 0 i 40 After the adjustment,ximum quantity that cai tem the ee at pe oe os path is 10 cars. This quantity shall - 13S follows: , added to the destination. The bs _ a he node 1 node 2: 10-10=0 ade 210 node 4 10-10= 0 Node to node 6: 10-10=0 theaddition appears as follows: Node 1 to node 2: 30 + 10 = 40 Node 2 to node 4: 10 + 10= 20 we d to node 6: 10 + 10 = 20 After the adjustment, the second iteration appears as follows:ZS 146 Moucevenr Soence: A Quormarve Areroac 10 Decison MANS SHO! TEST IQUE ite netwe Se ee msiders ete Beast fe me . fh that consice™ the fina pace The shortest path technique is an approach tt f origin. int of destination, paths to minimize the total distance from the Fae origi and the poin! words, it is the shortest distance between the point pnique: path tec] The following are the steps involved in the shortes ie 1. Construct the network. s igin. 2. Select the node nearest to the point of origi he node selected in step 2. 3. Locate the next node nearest to # reached. ination point is 4. Repeat steps 2 and 3 until the destination P i f the metropolitan area i different areas of the an ar eee eae are designated as the point, of Ree ec ee eats and cities. Nodes A and F passing through s lestination, respectively. The ing information is made available: ti wi ation is mi igin and d i spectively. The following 7 icipality _| Distance (in Kilometers)| From City/Municipality | To CityMniipal ty. TH a a 20 A B c 2 5 D 20 B E 10 ig E 4 D E 15 D F 10 . F 10 Required. Using the shortest path technique, qu determine the shortest distance from the point f origin to the point of destination, Answer. The following are the steps to take to determine the shortest route:PSS Te meme uN QUANTTATIVE APPROACH TO DECISION: MAKING . _ The shortest distance from the point of origin is through nodes B a a Kilometers. The second iteration appears as follows: 20 10 10 10 des A and B j ce between No is This time, the total distance is 15 kilometers. The distan kilometers and 5 kilometers between nodes B and C. —$_, ached. The distances from the point g Step 41 Repeat steps 2 and 3 until the destination point is aa origin to the different nodes are determined as follows: Node A to node C = 20 Node A through node B to node D (10 + 20) = 30 Node A through node B to node E (10 + 10) = 20 Node A through nodes B and C to node E (10 + 5 + 4)=19 .d iteration in the network isa The shortest route has 19 kilometers at this point. The thir follows: 20 10 10 The process is repeated until the destination point is reached. The path will pass throv nodes A, B, C, and E. The distances of the other nodes from these nodes are as follows: Node A through nodes B, C, and E to node D (10 +5 +4 + 15) =