Shortest-Route Problem

The shortest-route problem is

concerned with finding the shortest
path in a network from one node to
another node (or set of nodes).

2003 Thomson/South-Western

Slide 1

Shortest-Route Problem
The criterion to be minimized in the
shortest route problem is not limited
to distance even though the term
"shortest" is used in describing the
procedure. Other criteria include
time and cost.

2003 Thomson/South-Western

Slide 2

Terminology
Network: is an arrangement of paths
connected at various points through
which items move.
Why networks are popular?: They
provide a picture of a system and
because a large number of systems
can be easily modeled as networks.

2003 Thomson/South-Western

Slide 3

Terminology
Nodes/destinations: denoted by a
circle, represent junction points
connecting branches. (cities,
intersections, railroad terminals,
airports etc.)
Branches/routes: represented as lines,
paths connecting the nodes. (roads,
railroad tracks, air routes etc)
2003 Thomson/South-Western

Slide 4

Example
ABC Truckline Company transports
vegetables by six trucks from Ipoh
(node 1) to six cities (nodes 2, 3, 4, 5, 6
& 7) in Malaysian Peninsular.
The different routes between Ipoh and
the destination cities and the cost in
tens of RM for each route are shown in
the following figure:
2003 Thomson/South-Western

Slide 5

Example
To determine the best routes (the minimum cost)
for the trucks to reach their destinations.
25

2
16
IPOH

12
35

5
14

15

9
3

2003 Thomson/South-Western

19

14

17
22

Slide 6

Step 1

From node 1 (the origin), determine the minimum cost to

a directly connected node. Permanent branch cost
set
1

2
16
IPOH

35

1-2

16

1-4

35

1-3

9
3
Node 3 joins the permanent set
2003 Thomson/South-Western

The minimum
cost
Slide 7

Step 2

Repeat the process. Determine the

minimum cost to all nodes connected to
nodes 1 & 3.
2
16
IPOH

35

PS

1,3 1-2

16

1-4

35

3-4

24

3-6

31

15

9
3

22
Node 2 joins the permanent set
2003 Thomson/South-Western

Slide 8

Step 3
PS
Repeat the process. Determine the
minimum cost to all nodes connected to
1,2,3
nodes 1, 2 & 3.
25
2
5

16
IPOH

12
35

1-4

35

2-4

28

2-5

41

3-4

24

3-6

31

15

22
Node 4 joins the permanent set
2003 Thomson/South-Western

Slide 9

Step 4
Repeat the process. Determine the minimum cost to
all nodes connected to nodes 1, 2 , 3 & 4.
Route 1-4 & 2-4
can be neglected.
25
2
5
Why?
16
IPOH

14

4
15

9
3

2003 Thomson/South-Western

19

17
22

Slide 10

PS

1,2,3,4

2-5

41

3-6

31

4-5

38

4-7

43

4-6

41

Node 6 joins the permanent set

2003 Thomson/South-Western

Slide 11

25

16
IPOH

14

4
15

9
3

2003 Thomson/South-Western

19

17
22

Slide 12

Continue the process. Determine the minimum cost

to all nodes connected to nodes 1, 2, 3, 4 & 6.
25

2
16
IPOH

Route 4-6
neglected. Why?

5
14

19

15

9
3

2003 Thomson/South-Western

7
14

22

2-5
4-5
4-7
6-7

Slide 13

PS

1,2,3,4,6

2-5

41

4-5

38

4-7

43

6-7

45

Node 5 joins the permanent set

2003 Thomson/South-Western

Slide 14

Route 2-5 can be neglected. Why?

16
IPOH

14

19

15

9
3

2003 Thomson/South-Western

7
14

22

Slide 15

Continue the process. Determine the minimum

cost to all nodes connected to nodes 1, 2, 3, 4,
5 & 6.
2

16
IPOH

14

19

15

9
3

2003 Thomson/South-Western

7
14

22

Slide 16

PS

1,2,3,4,5,6

4-7

43

6-7

45

5-7

46

Node 7 joins the permanent set

2003 Thomson/South-Western

Slide 17

WE ARE DONE!!
2

16
IPOH

14

19

15

9
3

2003 Thomson/South-Western

22

Slide 18

SUMMARY
From Ipoh
to:
2

Route
1-2

Total
Cost
16

1-3

1-3-4

24

1-3-4-5

38

1-3-6

31

1-3-4-7

43

2003 Thomson/South-Western

Slide 19

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.
2003 Thomson/South-Western

Slide 20

Summary of steps for Shortest

Route Problems
Calculate

the total distance to

the end nodes.
Determine the shortest ones.
Neglect longer route.
Repeat the steps until all nodes
have joined the permanent set.

2003 Thomson/South-Western

Slide 21

Food of thought
Life is good for only two things,
discovering mathematics and teaching
mathematics.

2003 Thomson/South-Western

Slide 22