Scribd
Upload
100 views3 pages

Assignment #1 Busmath 13

The document summarizes the golden value method for finding the shortest route between nodes in a network. It provides an example problem with 7 nodes labeled 0-7. It calculates the golden value for each node, which is the shortest distance from node 0. It determines the shortest path is 0-1-2-5-6-7 by starting at the destination node 7, subtracting distances between connected nodes, and tracing back to the starting node 0. The path distance is 17. It provides a second example solved similarly, with the shortest path being 0-1-5-4-6-7-10 and a time of 25 minutes.

Uploaded by

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

Assignment #1 Busmath 13

The document summarizes the golden value method for finding the shortest route between nodes in a network. It provides an example problem with 7 nodes labeled 0-7. It calculates the golden value for each node, which is the shortest distance from node 0. It determines the shortest path is 0-1-2-5-6-7 by starting at the destination node 7, subtracting distances between connected nodes, and tracing back to the starting node 0. The path distance is 17. It provides a second example solved similarly, with the shortest path being 0-1-5-4-6-7-10 and a time of 25 minutes.

Uploaded by

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

Bucaloy, Romel B.

BSA Block 28

Assignment #1 BusMath 13
The method I’ve used is the golden value method and not the manual listing of any
possible routes. It is a method where you find the golden value of each nodes or the sum that
adds up from the start with the shortest distance.

Solution:
The yellow circle indicates the golden value of the node with the shortest add up sum possible.

12

0
17

18
14
The first node or the plant/origin has a golden value of zero. The second node has a
golden value of 7 because it is the distance between node 1 and 2. The third node has a golden
value of 9 and the fourth node has a golden value of 18 because like the second node, it is their
distance between the plant/origin. The fifth node has a golden value of 12 derived from the 7
(golden value of 2) plus 5 (distance between node 2 and 5). The other possible answer to this is
13 derived from 9 (the golden value of 3) plus 4 (distance between 3 and 5), but the golden value
must be the shortest add up sum so the answer is 12. Next, the sixth node has a golden value of
14 derived from 12 (golden value of 5) plus 2 (distance between node 5 and 6). The other
possible answer to this is 21 derived from 18 (the golden value of 4) plus 3 (distance between 4
and 6), but the golden value must be the shortest add up sum so the answer is 14. Then, the
golden value of the destination node is 17 derived from 14 (golden value of 6) plus 3 (distance
between node 6 and 7). ). The other possible answer to this is 18 derived from 12 (the golden
value of 5) plus 6 (distance between 5 and 6), but the golden value must be the shortest add up
sum so the answer is 17. From the golden value of the destination node which is 17, you must
subtract the distance between its neighbor nodes to find the path. In this case, 17-6 (distance
between 5 and 6) is 11, but the golden value of 5 is 12 so it is not the correct starting point to
trace the shortest path. While, 17-3 (distance between 6 and 7) is 14 which is also the same with
the golden value of node 6. Therefore, you can trace the shortest path from this by subtracting
the golden value of nodes until you reach the origin.
The answer to this question is: Route 1 2 5 6 7 which has a distance of 17.
Solution:

21
8

25

12
0

19
14
17

22
10

The answer to this question is: Route 1 5 4 6 7 10 with a time of 25 minutes.

You might also like