Shortest Path Model

• Network includes:
– Nodes: cities, customers, demand points
– Arcs or Links: Transportation links
– Number for each link to represent travel cost, time or
distance.

6 C
6
4 B
9
A 2 5 F
E
4
3
7
D

Shortest Path Problem

• Given:
– A network with a specified origin and destination.
– The distance (or travel time or cost) for each link.

• Determine the shortest path from the origin to

the destination.

• Solution: Labeling algorithm (one of many)

– Nodes are labeled as "solved" or "unsolved".
– Solved = shortest path from the origin to that node is
known.

1
 Shortest Path Labeling Algorithm

1. The origin is a solved node. All others are unsolved.

2. For each solved node, find the one unsolved node that is
nearest and calculate the minimum total distance (origin to
solved node + solved node to nearest unsolved node).

3. Make the unsolved node with the smallest total distance a

solved node.

4. Repeat steps 2 and 3 until the destination is a solved node.

5. Trace the shortest path.

Shortest Path Example 1

• Find the shortest path from A to F.

B 27
22
10
17
20 12 16 F
A C E
6
30 5
18
D

2
Shortest Path Example 1

B 27
22
10
* 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20

Shortest Path Example 1

B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C

3
Shortest Path Example 1

B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A
C

Shortest Path Example 1

B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22
C

4
Shortest Path Example 1

B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22
C D 26

Shortest Path Example 1

*
B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26

5
Shortest Path Example 1

B
* 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A
B
C

Shortest Path Example 1

B
* 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B
C

6
Shortest Path Example 1

B
* 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32
C

Shortest Path Example 1

B
* 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32
C D 26

7
Shortest Path Example 1
*
B 27
22
10
* * 17
20 12 16 F
A C E
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32
C D 26 D 26 C-D

*
B 27
22
10
* * 17
20 C 12 16 F
A E
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B
C
D

8
 *
B 27
22
10
* * 17
20 C 12 16 F
A E
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32
D E 31

*
B 27
22
10
* * 17
A 20 C 12
E
* 16 F
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32 E 31 D-E
D E 31

9
 *
B 27
22
10
* * 17
A 20 C 12
E
* 16 F
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32 E 31 D-E
D E 31
B
D
E

*
B 27
22
10
* * 17
A 20 C 12
E
* 16 F
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32 E 31 D-E
D E 31
B F 49
D F 44
E F 47

10
 *
B 27
22
10
* * 17 *
A 20 C 12
E
* 16 F
6
30 5
* 18
D
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32 E 31 D-E
D E 31
B F 49
D F 44 F 44 D-F
E F 47

Trace Shortest Path Backwards

Nearest Total Minimum

Solved Unsolved Distance Nearest Distance Path
A C 20 C 20 A-C
A B 22 B 22 A-B
C D 26
A D 30
B E 32 D 26 C-D
C D 26
B E 32
C E 32 E 31 D-E
D E 31
B F 49
D F 44 F 44 D-F
E F 47

A-C-D-F

11
Check Answer

B 27
22
10
17
20 12 16 F
A C E
6
30 5
18
D

A-C-D-F Length = 20+6+18 = 44

Shortest Path Example 2

• Find the shortest path from A to K.

3
D G
9 3
3
B
3 H 5
6 1

A E K
4 6 2
4 11
C I
1
6 4
J
F 5

12
 3
D G
9 3
3
B
3 H 5
0 6 1

A E K
4 6 2
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C

3
D G
9 3
3
B
3 H 5
0 6 1

A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A
C

13
 3
D G
6 9 3
3
B
3 H 5
0 6 1

A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8

3
D G
6 9 3
3
B
3 H 5
0 6 1

A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B
C

14
 3
D G
6 9 3
3
B
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E

3
D G
6 9 3
3
B
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B
C
E

15
 3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B D 15
C F 10
E H 9 H 9 E-H

3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
B
C
E
H

16
 3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
10 J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
B D 15
C F 10 F 10 C-F
E I 14
H D 12

3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
10 J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
B D 15
C F 10 F 10 C-F
E I 14
H D 12
B
C
E
H
F

17
 12 3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
10 J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
B D 15
C F 10 F 10 C-F
E I 14
H D 12
B D 15
C I 15
E I 14
H D 12 D 12 H-D
F I 14

12 3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8
A E K
4 6 2
4
4 11
C I
1
6 4
10 J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
C
E
H
F
D

18
 12 3
D G
6 9 3
3
B 9
3 H 5
0 6 1
8 14
A E K
4 6 2
4
4 11
C I
1
6 4
10 J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
C I 15
E I 14
H K 14 K 14 H-K
F I 14
D J 15

Shortest Length = 14

Trace Shortest Path Backwards

Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
B D 15
C F 10 F 10 C-F
E I 14
H D 12
B D 15
C I 15
E I 14
H D 12 D 12 H-D
F I 14
C I 15
E I 14
H K 14 K 14 H-K
F I 14
D J 15

19
Trace Shortest Path Backwards
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B D 15
C F 10
E H 9 H 9 E-H

A-C-E-H-K

Check Answer

3
D G
9 3
3
B
3 H 5
6 1

A E K
4 6 2
4 11
C I
1
6 4
J
F 5

A-C-E-H-K Length = 4+4+1+5 = 14

20
Shortest Path Example 3

• Find the shortest path from A to K.

16
D G
7 8
3
B
3 H 12
6 5

A E K
4 6 12
4 10
C I
1
16 4
J
F 5

16
D G
6 7 8
3
B
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E

First 3 steps are same as Example 2!

21
 16
D G
6 7 8
3
B
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B
C
E

16
D G
6 7 8
3
B
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B D 13
Tie for minimum distance
C I 14
E H 13 Select both!

22
 13 16
D G
6 7 8
3
B 13
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
A C 4 C 4 A-C
A B 6 B 6 A-B
C E 8
B E 9
C E 8 E 8 C-E
B D 13 D 13 B-D
C I 14
E H 13 H 13 E-H

13 16
D G
6 7 8
3
B 13
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
C
D
E
H

23
 13 16
D G
6 7 8
3
B 13
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
C I 14
D G 29 Tie for minimum distance
E I 14 Select both!
H K 25

13 16
D G
6 7 8
3
B 13
3 H 12
0 6 5
8
A E K
4 6 12
4
4 10
C I
1
16 4
J
F 5
Nearest Total Minimum
Solved Unsolved Distance Nearest Distance Path
C I 14 I 14 C-I
D G 29
E I 14 I 14 E-I
H K 25

There are two equal shortest

paths from the origin to I!

24
 Example 3 Answer
16
D G
7 8
3
B
3 H 12
6 5

A E K
4 6 12
4 10
C I
1
16 4
J
F 5

A-C-E-I-F-J-K Length = 4+4+6+4+5+1 = 24

A-C-I-F-J-K Length = 4+10+4+5+1 = 24

Shortest Path Software in LogWare

• ROUTE module.
• For each node, enter:
– Node number and name.
– X and Y coordinates if desired.
• For each link (arc), enter:
– “From node” number.
– “To node” number.
– Cost.
– Save data.
• Click Solve to get shortest paths from node 1
to all other nodes.

25
LogWare

ROUTE Module in LogWare

If possible, click “Add row”;

then enter data.

Otherwise, click “Open file”

and open Rfl01.dat.

26
ROUTE Module: Edit as desired

Now, Delete and Add rows

and edit data.
Save before solving.

ROUTE Module: Solution

27