Page 384 -
P. 384
364 CHAPTER 8 NETWORK MODELS
Travel time
in minutes 7
25
11
2
12 18
20 4
6 6
8
5
1
16 15 5
3
4 Find the shortest route between nodes 1 and 10 in the following network:
12
4 5
3
14
2 9 8
6 5
6
5 10
1 3 6 5 10
13 2
4
1 8
12 9
10
11
2 7
5 Morgan Trucking Company operates a special speedy pickup and delivery service in a
large city for ten clients who have a pickup contract with Morgan. When Morgan
receives a request for service, it dispatches a truck from its HQ to the requesting
service as soon as possible. With both fast service and minimum travel costs as
objectives for Morgan, it is important that the dispatched truck take the shortest route
from its central depot, C, to the specified location. Assume that the following network
(not drawn to scale) with distances given in km represents the highway network for this
problem. Find the shortest-route distances from ‘C’ to all ten clients.
70
1 7
50 20
20
35 40 30
20 2 5 8
35 60 50 10
C 20
10
30 40 9
3 6
30 15
40
60 40 10
4
Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
