chapter 6: network models
DESCRIPTION
Chapter 6: Network Models. Mute ur call. Network Models. There is a many of operation research situation is modeled and solved as network ( nodes can connected by branches) There are five network models algorithms 1- Minimal spanning tree 2- shortest-route algorithms - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/1.jpg)
Mjdah Al Shehri
Hamdy A. Taha, Operations Research: An introduction, 8th Edition
Chapter 6:Network Models
![Page 2: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/2.jpg)
Mute ur call
![Page 3: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/3.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 3
Network Models
• There is a many of operation research situation is modeled and solved as network ( nodes can connected by branches)
• There are five network models algorithms1- Minimal spanning tree2- shortest-route algorithms3- maximum-flow algorithms4- minimum cost capacitated network algorithms5- Critical path( CPM) algorithms
![Page 4: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/4.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 4
Network Models (CONT.)
1- Design of an offshore gas pipeline network connecting wellheads in gulf of Mexico to an inshore delivery points.; the objective of the model is minimize the cost constructing the pipeline.
• The situation represented as Minimal spanning tree.
2- Determination of the shortest route between two cities in a network of roads.
• This situation is shortest-route algorithms
![Page 5: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/5.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 5
Network Models (CONT.)
3- determination the maximum capacity (in ton per year) of a coal slurry pipeline network
• This situation is maximum flow algorithms
4- determination of the minimum-cost flow schedule from oil field to refineries through a pipeline network.
• This situation is minimum-cost capacitated network algorithms
![Page 6: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/6.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 6
Network Models (CONT.)
5- determination the time schdule (start and completion date) for activities• This situation is (CPM) algorithms
![Page 7: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/7.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 7
Network definitions
• A network consist of set of nodes linked by arcs ( or branches)
• The notion for describing a network is (N, A) where:– N is set of nodes– A set of arc
![Page 8: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/8.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 8
Network definitions (cont.)
• Example
• Flow : the amount sent from node i to node j, over an arc that connects them.
13
2
5
4
N ={ 1,2,3,4,5}
A={(1,2), (1,3),(2,3),(2,5),(3,4),(3,5),(4,2),(4,5)}
![Page 9: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/9.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 9
Network definitions (cont.)
• Directed/undirected arcs : • when flow is allowed in one direction the arc is directed; (that
means allow positive flow in one direction and zero flow in the opposite direction)
• When flow is allowed in two directions, the arc is undirected.
• Path : sequence of distinct arcs that join two nodes through other nodes regardless of the direction of flow in each arcs• The nodes are said to be connected if there is a path between
them.
9
![Page 10: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/10.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 10
Network definitions (cont.)
• Cycle : a path starting at a certain node and returning to the same node without using any arc twice. (or connects a node to itself through other nodes)
Example:
– (2,3),(3,5),(5.2) form of loop– Cycle is directed if it consists of directed path (2,3),
(3,4) and( 4,2)
10
13
2
5
4
![Page 11: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/11.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 11
Network definitions (cont.)
• Tree : is connected network that may involve only a subset of all nodes of network without cycle.
• Spanning tree : a tree that connects all the nodes in a network with no cycle( it consists of n -1 arcs).
1
2
3
13
2
5
41
2
3
4
5
Tree Spanning Tree
![Page 12: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/12.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 12
Minimal Spanning tree
• It deals with linking the nodes of network, directly or indirectly, using shortest length of connecting branches.
• The typical application occurs in construction of paved roads that link several towns.
![Page 13: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/13.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 13
Minimal Spanning tree
• The step of procedure are given as follows:– Let N={ 1,2,…n} set of nodes– Ck= set of nodes that have been permanently connected at iteration K– Ck`= set of nodes as yet to be connected permanently.
• Step 0: set C0= 0, C0`=N• Step 1: start with any node I; set C1={i}, C1`=N-{i}• General step: selected node j in unconnected set
Ck-1` that yield in shortest arcs to a node in the connected set . Link j permanently to Ck-1 and remove it from Ck-1`
- If the set of unconnected nodes is empty stop. Otherwise set k=K+1 and repeat the step
![Page 14: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/14.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 14
Example (cont.)
• Midwest TV cable company is in the process of providing cable service to five new housing development service areas.
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
![Page 15: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/15.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 15
Example (cont.)
• The algorithms start at node 1
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
![Page 16: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/16.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 16
Example (cont.)
• Iteration 1
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C1
C1 `
![Page 17: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/17.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 17
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C1 `
C1
![Page 18: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/18.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 18
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C2
![Page 19: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/19.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 19
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C2
C2 `
3
4
6
52
1
1957
4 63
5
10
83
![Page 20: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/20.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 20
Example (cont.)
• iteration2
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C2
C2 `
![Page 21: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/21.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 21
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C2
C2 `
![Page 22: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/22.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 22
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C3
3
4
6
52
1
1957
4 63
5
10
83
C3 `
![Page 23: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/23.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 23
Example (cont.)• iteration3
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C3
C3 `
![Page 24: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/24.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 24
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C3
C3 `
![Page 25: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/25.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 25
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C4
3
4
6
52
1
1957
4 63
5
10
83
C4 `
![Page 26: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/26.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 26
Example (cont.)• iteration4
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C4
C4 `
![Page 27: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/27.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 27
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C4
C4 `
![Page 28: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/28.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 28
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C5
3
4
6
52
1
1957
4 63
5
10
83
C5 `
![Page 29: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/29.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 29
Example (cont.)• iteration5
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C5
C5 `
Alternate links
![Page 30: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/30.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 30
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
C5
C5 `
Alternate links
![Page 31: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/31.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 31
Example (cont.)
3
4
6
52
1
1
9
5
7
4 6
3
5
10
8
3
![Page 32: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/32.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 32
Example (cont.)
• Summery of solutioniteration Minimum
distance connecting arc
distance Add arc to tree? Cumulative tree distance
1 (1,2) 1 yes 1
2 (2,5) 3 yes 4
3 (2,4) 4 yes 8
4 (4,6) 3 yes 11
5 (4,3) 5 yes 16
![Page 33: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/33.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 33
Example 2
• Apply minimal spanning tree
A
E
C
BD
F2
8
7
7
59
4
38
![Page 34: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/34.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 34
Solution
A
E
C
BD
F2
8
7
7
59
4
38
A
E
C
BD
F2
8
7
7
59
4
38
![Page 35: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/35.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 35
Solution (cont.)
A
E
C
BD
F2
8
7
7
59
4
38
A
E
C
BD
F2
8
7
7
59
4
38
![Page 36: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/36.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 36
Solution (cont.)
A
E
C
BD
F2
8
7
7
59
4
38
A
E
C
BD
F2
8
7
7
59
4
38
![Page 37: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/37.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 37
Example 3
9
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 38: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/38.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 38
Solution
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 39: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/39.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 39
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 40: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/40.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 40
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 41: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/41.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 41
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 42: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/42.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 42
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 43: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/43.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 43
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 44: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/44.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 44
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 45: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/45.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 45
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 46: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/46.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 46
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 47: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/47.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 47
Solution (cont.)
A
B
C
D
E
FH
I
J
G
6 4
3
99
818
29
8
2
9
97
10
5
4
13
4
![Page 48: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/48.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 48
Shortest- Route problem
• The shortest route problem determines the shortest route between a source and destination.
• There are two algorithms to solve shortest-route problems:
• 1- Dijkstra’s algorithm that design to determine the shortest routes between the source node every other node in the network
• 2- Floyd’s algorithms is general because it allow the determination of the shortest route between any two node in network
![Page 49: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/49.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 49
Dijkstra’a algorithm
Step0: label the source node(node1) with the permanent label [0,--]. Set i=1
Stepi= (a) compute the temporary labels[ui+dij,i] for each node j that can be reached through node i. provided j is not permanently label. If node j is already label with [uj,k] through another node k and if ui+dij< uj, replace [uj,k] with [ ui+ dij, i]
(b) if all node have premanent label stop. Otherwise select the label [Ur,s] having the shortest distance (=ui) among all temporary label. Set i=r and repeat step i
![Page 50: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/50.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 50
Example
• The figure give the route and their length in miles between city 1 and four other cities. Determine the shortest route between city 1 and each of the remaining four cities.
1
2
3
4
5
100
30
20
15
5010
60
![Page 51: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/51.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 51
Example(cont.)
• Iteration 0: assign permanent label [0,--] to node 1• Iteration 1: node 2 and 3 can be reached from (the last permanent
labeled) node 1 thus the list labeled node (temporary and permanent) becomes
• For both two temporary label[100,1] and [30,1] node 3 is smallest distance so, status of node 3 is changed to permanent
1
2
3
4
5
100
30
20
1550
1060
Node label status
1 [0,--] permanent
2 [0+100, 1] temporary
3 [0+30,1] temporary
![Page 52: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/52.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 52
Example(cont.)
• Iteration2: node 4, and 5 can be reached from node 3 and the list labeled node becomes:
• node 4 is smallest distance so from the temporaries list. so, status of node 4 is changed to permanent
Node label status
1 [0,--] permanent
2 [100, 1] temporary
3 [30,1] Permanent
4 [30+10,3]=[40,3] temporary
5 [30+60,3]=[90,3] temporary
1
2
3
4
5
100
30
20
1550
1060
![Page 53: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/53.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 53
Example(cont.)
• Iteration 3: node 2 and 5 can be reached from node4. the list of labeled is updated as
• Node 2 is permanent
Node label status
1 [0,--] permanent
2 [40+12,4]=[55,4] temporary
3 [30,1] Permanent
4 [40,3] Permanent
5 [90,3] or [40+50,4] temporary
1
2
3
4
5
100
30
20
1550
1060
![Page 54: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/54.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 54
Example(cont.)
• Iteration 4: only node 3 can be reached from node 2, the node 3 is permanent , so the new list remain the same
• Because node 5 is not lead to other node, it is status will convert to permanent
Node label status
1 [0,--] permanent
2 [55,4] permanent
3 [30,1] Permanent
4 [40,3] Permanent
5 [90,3] or [40+50,4] temporary
![Page 55: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/55.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 55
Example(cont.)
• The process ends
• The shortest route between node1 and node2 is:• (2) [55,4](4) [40,3](3) [30,1](1)• So the disired route is 1342 with total length 55 miles
Node label status
1 [0,--] permanent
2 [55,4] permanent
3 [30,1] Permanent
4 [40,3] Permanent
5 [90,3] or [40+50,4] Permanent
![Page 56: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/56.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 56
Floyd’s algorithm
• Step0: define starting distance matrix D0 and node sequence matrix S0. the diagonal elements are marked with(-). Set k=1
• General step k: define row k and column as pivot row and pivot column. Apply the triple operation to each element dij in Dk-1. if the condition:
Dik+dkj<dij Is satisfied, make the following changes:• (a) creat Dk by replacing dij in Dk-1 with dik+dkj• (b) create Sk by repacing sij in sk-1 with k. set k=k+1 and
repeat step k.
![Page 57: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/57.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 57
Floyd’s algorithm (cont.)
• Step k : if the sum elements on the pivot row and povot coumn is smaller thanassociated intersection elements, the it is optimal to replace the intersection distance by the sum of pivot distance.
• After n step, it can determine the shortest route by using the following rules:
• 1- from D dij gives the shortest distance• 2- from S determine the intermediate node.
![Page 58: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/58.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 58
Example
1
2
3
4
5
3
10
5
6
15
4
D0 s0
![Page 59: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/59.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 59
Example (cont.)
• K=1 • We highlight the first column and first row of the Distance matrix and
compare all other items with the sum of the items highlighted in the same row and column.
• If the sum is less than the item then it should be replaced with the sum.
![Page 60: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/60.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 60
Example (cont.)
• When (-) is involved we leave the item.
D0 S0
![Page 61: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/61.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 61
Example (cont.)
• 10+3=13 is less than ∞So change
D0 S0
![Page 62: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/62.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 62
Example (cont.)
• 10+3=13 is less than ∞So change
D0 S0
![Page 63: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/63.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 63
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 64: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/64.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 64
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 65: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/65.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 65
Example (cont.)
• 3+10=13 less than ∞,So change
D0 S0
![Page 66: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/66.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 66
Example (cont.)
• When (-) is involved we leave the item.
D0 S0
![Page 67: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/67.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 67
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 68: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/68.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 68
Example (cont.)
When ∞is involved we leave the item.
D0 S0
![Page 69: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/69.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 69
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 70: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/70.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 70
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 71: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/71.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 71
Example (cont.)
• When (-) is involved we leave the item.
D0 S0
![Page 72: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/72.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 72
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 73: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/73.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 73
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 74: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/74.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 74
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 75: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/75.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 75
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 76: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/76.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 76
Example (cont.)
• When ∞is involved we leave the item.
D0 S0
![Page 77: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/77.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 77
Example (cont.)
![Page 78: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/78.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 78
Example (cont.)
• We have now completed one iteration. We rename the new matrices:
D1 S1
![Page 79: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/79.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 79
Example (cont.)
• Set k=2• We highlight the second column and second
row of the Distance matrix and compare all other items with the sum of the items highlighted in the same row and column.
• If the sum is less than the item then it should be replaced with the sum.
![Page 80: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/80.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 80
Example (cont.)
• When (-) is involved we leave the item.
D1 S1
![Page 81: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/81.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 81
Example (cont.)
• 3+13=16 Not Less than 10
D1 S1
![Page 82: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/82.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 82
Example (cont.)
• 3+5=8 less than ∞So change
D1 S1
![Page 83: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/83.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 83
Example (cont.)
• 3+5=8 less than ∞So change
D1 S1
![Page 84: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/84.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 84
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 85: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/85.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 85
Example (cont.)
• 3+13=16 Not less than 10
D1 S1
![Page 86: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/86.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 86
Example (cont.)
• When (-) is involved we leave the item.
D1 S1
![Page 87: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/87.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 87
Example (cont.)
• 5+13=18 Not less than 6
D1 S1
![Page 88: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/88.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 88
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 89: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/89.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 89
Example (cont.)
• 3+5=8 less than ∞So change
D1 S1
![Page 90: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/90.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 90
Example (cont.)
• 3+5=8 less than ∞So change
D1 S1
![Page 91: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/91.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 91
Example (cont.)
• 13+5=18 Not less than 6
D1 S1
![Page 92: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/92.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 92
Example (cont.)
• When (-) is involved we leave the item.
D1 S1
![Page 93: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/93.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 93
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 94: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/94.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 94
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 95: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/95.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 95
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 96: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/96.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 96
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 97: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/97.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 97
Example (cont.)
• When ∞is involved we leave the item.
D1 S1
![Page 98: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/98.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 98
Example (cont.)D1 S1
![Page 99: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/99.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 99
Example (cont.)
• We have now completed two iteration. We rename the new matrices:
D2S2
![Page 100: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/100.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 100
Example (cont.)
• Set k=3• We highlight the third column and third row of
the Distance matrix and compare all other items with the sum of the items highlighted in the same row and column.
• If the sum is less than the item then it should be replaced with the sum.
![Page 101: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/101.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 101
Example (cont.)D2 S2
![Page 102: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/102.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 102
Example (cont.)D2 S2
![Page 103: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/103.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 103
Example (cont.)D2 S2
![Page 104: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/104.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 104
Example (cont.)
• We have now completed third iteration. We rename the new matrices:D3 S3
![Page 105: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/105.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 105
Example (cont.)
• Set k=4• We highlight the fourth column and fourthrow of
the Distance matrix and compare all other items with the sum of the items highlighted in the same row and column.
• If the sum is less than the item then it should be replaced with the sum.
![Page 106: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/106.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 106
Example (cont.)
D3 S3
![Page 107: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/107.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 107
Example (cont.)
D3 S3
![Page 108: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/108.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 108
Example (cont.)
• We have now completed fourth iteration. We rename the new matrices:D4 S4
![Page 109: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/109.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 109
Example (cont.)
• Set k=5• We highlight the fifth column and fifth row of the
Distance matrix and compare all other items with the sum of the items highlighted in the same row and column.
• If the sum is less than the item then it should be replaced with the sum.
![Page 110: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/110.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 110
Example (cont.)
• No further improvement are possible in this iteration, D5,S5 are the same D4 and S4
D4 S4
![Page 111: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/111.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 111
Example (cont.)
• Shortest distance is d15 =12• Associated route: recall segment(I,j) if Sij=J is direct
link otherwise they link through intermediate node.
D4 S4
![Page 112: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/112.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 112
Example (cont.)
• S15= 4 ≠ 5 so. The initial link is 145• Now, s14=2. is not direct link and 14 must replaced with 124, so the
road from 1 to 5 will be change to 1245.• Now s12=2, s24=4,s45=5. the route 1245 need no further
dissecting and the process end
![Page 113: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/113.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 113
Maximal flow algorithm
• In a maximal flow problem, we seek to find the maximum volume of flow from a source node to terminal sink node in a capacitated network.
• Maximum flow algorithm is straightforward.
113
![Page 114: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/114.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 114
How it works
• In maximum flow algorithm, we determine if there is any path from source to sink that can carry flow.
• If there is , the flow is augmented as much as possible along this path; and residual capacities of the arc used on the path are reduced accordingly.
114
![Page 115: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/115.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 115
Steps of maximum flow algorithm
• Step1: find path from the source to the sink that has positive residual capacities. If no path have positive, STOP; the maximum flow have been found
• Step2: Find the minimum residual capacity of the arc on the path ( call it K) and augment the flow on each involved arc by K
• Step3: Adjust the residual capacities of arcs on the path by decreasing the residual capacities in direction of flow by K; and increasing the residual capacities in the direction opposite the flow by K;
GO TO STEP 1115
![Page 116: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/116.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 116
Example
• Determine the maximum flow in the network.
116
1
2
4
5
3
10
30
20 30
040 0
20
0
0
5
10
0 20
0
0
![Page 117: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/117.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 117
Example (cont.)
• Iteration1:Select Path: 145
117
1
2
4
5
3
10
30
20 30
040 0
20
00
5
10
0 20
00
Residual capacities
1-4 10
2-5 20
Augment flow by 10Reduce forward capacities by 10Increase backward capacities by 10
1
2
4
5
3
0
30
20 30
040 0
20
00
5
10
10 10
100
1010
![Page 118: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/118.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 118
Example (cont.)
• Iteration 2:• No additional possible flow along arc(1,4); thus find new path; Select
path 1345
118
Residual capacities
1-3 30
3-4 10
4-5 10
1
2
4
5
3
030
20 30
040 0
20
00
5
10
10 10
100
1010
Augment flow by 10Reduce forward capacities by 10Increase backward capacities by 10
1
2
4
5
3
0
20
20 30
040 0
20
010
15
0
10 0
200
10
10
10
10
10
![Page 119: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/119.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 119
Example (cont.)
• Iteration 3:• No additional possible flow along arc(3,4) and (4,5); thus find new path;
Select path 135
119
1
2
4
5
3
0
20
20 30
040 0
20
010
15
0
10 0
200
10
10
20
10
Residual capacities
1-3 20
3-5 20
Augment flow by 20Reduce forward capacities by 20Increase backward capacities by 20
1
2
4
5
3
0
0
20 30
040 0
0
2030
15
0
10 0
200
10
10
20
10
20
20
![Page 120: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/120.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 120
Example (cont.)
• Iteration 4:• No additional possible flow along arc(1,3) and (3,5); thus find new path;
Select path 125
120
1
2
4
5
3
00
20 30
040 0
0
2030
15
0
10 0
200
10
30
20
10
20
Residual capacities
1-2 20
2-5 30
Augment flow by 20Reduce forward capacities by 20Increase backward capacities by 20
1
2
4
5
3
00
0 10
2040 0
0
2030
15
0
10 0
2020
10
30
20
10
2020
20
![Page 121: Chapter 6: Network Models](https://reader030.vdocuments.us/reader030/viewer/2022033004/5681356d550346895d9cd40d/html5/thumbnails/121.jpg)
Hamdy A. Taha, Operations Research: An introduction, Prentice Hall 121
Example (cont.)
• Iteration 4:• No more flow is possible flow because there is no residual capacity left
on the cut consisting (1,2),(1,3), and (1,4); so maximum flow is 20+30+10=60.
121
1
2
4
5
3
00
0 10
2040 0
0
2030
15
0
10 0
2020
10
30
20
10
2020
20From To Flow
1 2 20
1 3 30
1 4 10
2 5 20
3 4 10
3 5 20
4 5 20