[go: up one dir, main page]
Scribd
Upload
80 views3 pages

04 - Problem - Solving - 1 - Umayam - BSA701 - MS

The document provides the steps to determine the shortest route between Atlanta and 5 other cities in a network. It then provides the steps to develop a minimal spanning tree to connect 6 communities in a city with the minimum amount of rail track, based on the miles between each community. It notes that the original work did not fully follow the methodology by considering all possible minimum cost branches at each step.

Uploaded by

Love Co
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
80 views3 pages

04 - Problem - Solving - 1 - Umayam - BSA701 - MS

The document provides the steps to determine the shortest route between Atlanta and 5 other cities in a network. It then provides the steps to develop a minimal spanning tree to connect 6 communities in a city with the minimum amount of rail track, based on the miles between each community. It notes that the original work did not fully follow the methodology by considering all possible minimum cost branches at each step.

Uploaded by

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

Name: Umayam, Ma. Czarina Ann T.

Section: BSA701

Subject: Management Science Date: 10/31/21

04_Problem_solving_1

Answer:

A. Determine the shortest route from Atlanta to each of the other five (5) cities in the network.
1.Permanent Set Branch Time
(1) 12 55
13 5
14 7
2.Permanent Set Branch Time
(1,2) 13 5
5
14 7
25 11
3. Permanent Set Branch Time
(1,2,3) 14 7
5
25 11
34 7
4. Permanent Set Branch Time
(1,2,3,4) 45 10
45 9
5
5. Permanent Set Branch Time
(1,2,3,4,,6) 45 10
5
65 13
6.Permanent Set
(1,2,3,4,5,6)

The shortest route network follows:

B. Assume that the network now represents six (6) different communities in a city. The local
transportation authority wants to design a rail system to connect all six (6) communities with the
minimum amount of track. The miles between each community are shown on each branch. Develop a
minimal spanning tree for this problem.
The nearest unconnected node to node 1 is node 2.

The nearest unconnected node to 1 and 2 is node 3.

The nearest unconnected node to 1, 2, and 3 is node 4.

The nearest unconnected node to 1, 2, 3, and 4 is node 6.

The nearest unconnected node to 1, 2, 3, 4, and 6 is node 5.

The negligible spreading over tree follows; the shortest absolute distance is 17 miles:

Since 4-5 is 10 which is less than 2-5 that is 11, they don't feel like writing 2-5 in these two steps. They
are using the mind instead of following the methodology. This is not the perfect way to implement this
as you have already figured out. One should first write the minimum cost branches that emerge from all
the visited nodes and end at the unvisited nodes. So, when node-2 is visited in step-2, one should
consider branch 2-5 until step-6 where node-5 is in permanent set. The branch 2-5 is not the minimum
compared to 4-5 is a matter f chance only as you have mentioned.

You might also like