decision analysisShortest-Route Problem
*
Shortest-Route Problem
*
Slide
Terminology
Network: is an arrangement of paths connected at various points through which items move.
*
*
Slide
Example
*
Slide
Example
To determine the best routes (the minimum cost) for the trucks to reach their destinations.
6
3
16
35
12
9
15
22
17
14
25
8
14
4
1
2
5
7
IPOH
19
Step 1
From node 1 (the origin), determine the minimum cost to a directly connected node.
3
16
35
9
4
1
2
IPOH
The minimum cost
Step 2
Repeat the process. Determine the minimum cost to all nodes connected to nodes 1 & 3.
6
3
16
35
9
15
22
4
1
2
IPOH
PS
B
C
1,3
1-2
16
1-4
35
3-4
24
3-6
31
Repeat the process. Determine the
minimum cost to all nodes connected to nodes 1, 2 & 3.
6
3
16
35
12
9
15
22
25
4
1
2
5
IPOH
PS
B
C
1,2,3
1-4
35
2-4
28
2-5
41
3-4
24
3-6
31
Step 4
Repeat the process. Determine the minimum cost to all nodes connected to nodes 1, 2 , 3 & 4.
6
3
16
9
15
22
17
14
25
4
1
2
5
7
IPOH
19
*
PS
B
C
1,2,3,4
2-5
41
3-6
31
4-5
38
4-7
43
4-6
41
Slide
Continue the process. Determine the minimum cost to all nodes connected to nodes 1, 2, 3, 4 & 6.
6
3
16
9
15
22
14
25
14
4
1
2
5
7
IPOH
19
PS
B
C
1,2,3,4,6
2-5
41
4-5
38
4-7
43
6-7
45
*
Slide
6
3
16
9
15
22
14
14
4
1
2
5
7
IPOH
19
Continue the process. Determine the minimum cost to all nodes connected to nodes 1, 2, 3, 4, 5 & 6.
8
PS
B
C
1,2,3,4,5,6
4-7
43
6-7
45
5-7
46
Summary of steps for Shortest Route Problems
Select the node with the shortest direct route from the origin.
Establish a permanent set: origin plus node from the above step.
Determine all nodes directly connected to the permanent set.
*
Calculate the total distance to the end nodes.
Determine the shortest ones.
Neglect longer route.
*
Food of thought…