Scribd
Upload
34 views27 pages

QAch7 Route Spanning

1. The document discusses finding the shortest routes between an origin city and 6 other cities using a quick method. 2. The method involves starting at the origin, finding the shortest connection to the next city, marking it as permanent, and repeating until all cities are connected. 3. The shortest routes from the origin to each of the 6 cities are presented in a table with the cities, routes, and distances.

Uploaded by

Amr Hamdy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
34 views27 pages

QAch7 Route Spanning

1. The document discusses finding the shortest routes between an origin city and 6 other cities using a quick method. 2. The method involves starting at the origin, finding the shortest connection to the next city, marking it as permanent, and repeating until all cities are connected. 3. The shortest routes from the origin to each of the 6 cities are presented in a table with the cities, routes, and distances.

Uploaded by

Amr Hamdy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
You are on page 1/ 27

MIBA

ESLSCA XX
Group A
Quantitative analysis
Shortest route & Minimal spanning
Under supervision of Prof.
Dr. Ehab Yaseen
Presented By
Amr Ezz El Din Hamdy
Group 16A 1
Shortest route

2
Chapter 7, problem 3, page 279.

Find the shortest route from origin 1 to other 6 cities.

2 31

85
5 72
61
53
117 7
1 3

24
88 65
137 6
4

3
We will use the quick way of Dr. Ehab Yaseen.
First we start from the origin, and see the connected node.
We choose the shortest route among and mark it up.

85

53
53
1 3
[53,1]
88

4
Node 1 & 3 become permanent nodes, we look for next
nodes connected to them and find shortest route among and
mark it up.

1-2=85
[85,1]
22 31 1-3-5=114

85
5 72
61 1-3-7=170
53
117 7
1 3
[53,1]
24
88 65
137 6
4

1-4=88
1-3-4=118 5
Node 1,2 & 3 become permanent nodes, we look for next nodes
connected to them and find shortest route among and mark it up. We
remove non selected route between permanent nodes, route 3-4.

[85,1]
1-2-5=116
2 31 1-3-5 = 114

85
5 72
61 1-3-7=170
53
117 7
1 3
[53,1]
88 24
88 65
137 6
44
[88,1]
1-4=88
1-3-4=118 6
Node 1, 2, 3 & 4 become permanent nodes, we look for next nodes
connected to them and find shortest route among and mark it up. We
remove non selected route between permanent nodes, route 2-5.

[85,1]
1-2-5=116

2 1-3-5 = 114
31
85 [114,3]
55 72 1-3-7=170
61
53
117 7
1 3
[53,1]
88 24

137 6
44
[88,1] 1-4-6=225

7
Node 1, 2, 3, 4 & 5 become permanent nodes, we look for next nodes
connected to them and find shortest route among and mark it up. We
also remove non selected route between permanent nodes, route 5-7.

[85,1]

2 [114,3]
1-3-7=170
85
5 7272 1-3-5-7=186
61
53
117
117 7
1 3
[53,1]
24 [170,3]
88

137 6
44
[88,1] 1-4-6=225

8
Node 1, 2, 3, 4, 5 & 7 become permanent nodes, we look for next nodes
connected to them and find shortest route among and mark it up. We
also remove non selected route between permanent nodes, route 4-6.

[85,1]

2 [114,3]
85
5 [170,3]
61
53
117 7
1 3
[53,1] 24
88 24
24
137 66
[194,7]
44
[88,1] 1-4-6=225
1-3-7-6=194
9
We summarize our solution in the
following table
From Roanoke (1) to Route Distance

2 - Staunton 1-2 85 Miles

3 - Lynchburg 1-3 53 Miles

4 - Danville 1-4 88 Miles

5 - Charlottesvilles 1-3-5 114 Miles

6 - Petersburg 1-3-7-6 194 Miles

7 - Richmond 1-3-7 170 Miles


10
Shortest Route to 2 is 1 – 2
and equals 85 miles

2 31

85
5 72
61
53
117 7
1 3

24
88 65
137 6
4

11
Shortest Route to 3 is 1 – 3
and equals 53 miles

2 31

85
5 72
61
53
117 7
1 3
24
88 65
137 6
4

12
Shortest Route to 4 is 1 – 4
and equals 88 miles

2 31

85
5 72
61
53
117 7
1 3

24
88 65
137 6
4

13
Shortest Route to 5 is 1 - 3 - 5
and equals 114 miles

2 31

85
5 72
61
53
117 7
1 3
24
88 65
137 6
4

14
Shortest Route to 6 is 1 – 3 – 7 – 6
and equals 194 miles

2 31

85
5 72
61
53
117 7
1 3
24
88 65
137 6
4

15
Shortest Route to 7 is 1 – 3 – 7
and equals 170 miles

2 31

85
5 72
61
53
117 7
1 3
24
88 65
137 6
4

16
Minimal spanning

17
Let us solve the same problem for minimal spanning.
Assume that, we want to supply those cities with electricity,
and we want to Connect all nodes in a network so that the
total branch lengths are minimized.

2 31

85
5 72
61
53
117 7
1 3

24
88 65
137 6
4

18
We start from any node; see the nearest node; and
mark it up. We will start from node 1.

85

53
53
1 3

88

19
Select the closest node not presently in the
spanning area and mark it up.

2 31

85
55 72
61
61
53 117
1 7
3
24
88 65
137 6
4

20
Select the closest node not presently in the spanning area
and mark it up We remove unused branches between
connected nodes (1-2).

22 31
31

85
5 72
61
53 117
1 7
3
24
88 65
137 6
4

21
Select the closest node not presently in the spanning area
and mark it up. We remove unused branches between
connected nodes (1-4).

31
2
5 72
61
53 117
1 7
3
24
88 65 65
137 6
44

22
Select the closest node not presently in the spanning area
and mark it up. We remove unused branches between
connected nodes (3-7).

31
2
5 7272
61
53 117
1 7
3
24
65
137 6
4

23
Select the closest node not presently in the spanning area
and mark it up. We remove unused branches between
connected nodes (4-6).

31
2
5 72
61
53
1 7
3
24
65 24
137 6
4

24
The total length distance is the sum of all branches.
Total length distance = 53 + 65 + 61 + 31+ 72 + 24
= 306 Miles of electric cables
31
2
5 72
61
53
1 7
3

65 24
6
4

25
Thank You
for your
Attention
26
MIBA
ESLSCA XX
Group A

Quantitative analysis
Shortest route & Minimal spanning
Under supervision of Prof.
Dr. Ehab Yaseen
Presented By
Amr Ezz El Din Hamdy
Group 16A 27

You might also like