PHÂN TÍCH ĐỊNH LƯỢNG TRONG QUẢN TRỊ

CHƯƠNG 3: MÔ HÌNH TỐI ƯU MẠNG LƯỚI

1 / 49
Nội dung bài giảng

1. TRANSPORTATION PROBLEM

2. ASSIGNMENT PROBLEM

3. TRANSSHIPMENT PROBLEM

4. MINIMAL-SPANNING TREE PROBLEM

5. SHORTEST-ROUTE PROBLEM

2 / 49
1. TRANSPORTATION PROBLEM
The Transportation Problem
The transportation problem deals with the distribution of goods from
several points of supply (origins or sources) to a number of points of
demand (destinations). Usually we are given a capacity (supply) of goods at
each source, a requirement (demand) for goods at each destination, and the
shipping cost per unit from each source to each destination. The objective of
such a problem is to schedule shipments so that total transportation costs
are minimized.

3 / 49
Example: Solve the following transportation problem:

4 / 49
5 / 49
6 / 49
2. ASSIGNMENT PROBLEM
The Assignment Problem
The assignment problem refers to the class of Linear Programming
problem that involve determining the most efficient assignment of people to
projects, sales people to territories, auditors to companies for audits,
contracts to bidders, jobs to machines, heavy equipment (such as cranes) to
construction jobs, and so on. The objective is most often to minimize total
costs or total time of performing the tasks at hand.

7 / 49
Example: Solve the following assignment problem:

8 / 49
9 / 49
10 / 49
3. TRANSSHIPMENT PROBLEM
The Transshipment Problem
In a transportation problem, if the items being transported must go through
an intermediate point (called a transshipment point) before reaching a final
destination, the problem is called a transshipment problem. For example, a
company might be manufacturing a product at several factories to be
shipped to a set of regional distribution centers. From these centers, the
items are shipped to retail outlets that are the final destinations.

11 / 49
Example: Solve the following transshipment problem:

12 / 49
13 / 49
14 / 49
15 / 49
16 / 49
4. MINIMAL-SPANNING TREE PROBLEM
Minimal-Spanning Tree Problem
The minimal-spanning tree technique involves connecting all the points of
a network together while minimizing the distance between them. It has been
applied, for example, by telephone companies to connect a number of phones
together while minimizing the total length of telephone cable.

17 / 49
Four Steps for the Minimal-Spanning Tree Technique
Step 1. Select any node in the network.
Step 2. Connect this node to the nearest node that minimizes the total
distance
Step 3. Considering all of the nodes that are now connected, find and
connect the nearest node that is not connected. If there is a tie for the
nearest node, select one arbitrarily. A tie suggests there may be more
than one optimal solution
Step 4. Repeat the third step until all nodes are connected

18 / 49
Example: Let us consider the Lauderdale Construction Company,
which is currently developing a luxurious housing project in Panama
City Beach, Florida. Melvin Lauderdale, owner and president of
Lauderdale Construction, must determine the least expensive way to
provide water and power to each house. The network of houses is
shown in the following figure:

19 / 49
First iteration:

20 / 49
Second iteration:

21 / 49
Third iteration:

22 / 49
Fourth iteration:

23 / 49
Fifth iteration:

24 / 49
Sixth iteration:

25 / 49
Seventh iteration:

26 / 49
Summarized by table:

27 / 49
Bài tập mẫu

28 / 49
Solution

29 / 49
Bài tập
The director of security wants to connect security video cameras to the main control site from five
potential trouble locations. Ordinarily, cable would simply be run from each location to the main
control site. However, because the environment is potentially explosive, the cable must be run in a
special conduit that is continually air purged. This conduit is very expensive but large enough to
handle five cables (the maximum that might be needed). Use the minimal-spanning tree technique
to find a minimum distance route for the conduit between the locations noted in the following
figure.

30 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .31
. / 49
Bài tập
Solve the minimal-spanning tree problem in the network shown in the following figure. Assume that
the numbers in the network represent distance in hundreds of yards.

32 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .33
. / 49
Bài tập
Bechtold Construction is in the process of installing power lines to a large housing development.
Steve Bechtold wants to minimize the total length of wire used, which will minimize his costs. The
housing development is shown as a network in the following figure. Each house has been numbered,
and the distances between houses are given in hundreds of feet. What do you recommend?

34 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .35
. / 49
Bài tập

36 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .37
. / 49
5. SHORTEST-ROUTE PROBLEM
The Shortest-Route Problem
The objective of the shortest-route problem is to find the shortest distance
from one location to another. In a network, this often involves determining
the shortest route from one node to each of the other nodes. This problem
can be solved either by the shortest-route technique or by modeling this as a
linear program with 0-1 variables.

38 / 49
Steps of the Shortest-Route Technique
Step 1. Find the nearest node to the origin (plant). Put the distance in
a box by the node
Step 2. Find the next-nearest node to the origin (plant), and put the
distance in a box by the node. In some cases, several paths will have to
be checked to find the nearest node
Step 3. Repeat this process until you have gone through the entire
network. The last distance at the ending node will be the distance of
the shortest route. You should note that the distance placed in the box
by each node is the shortest route to this node. These distances are
used as intermediate results in finding the next-nearest node

39 / 49
Example: Every day, Ray Design, Inc., must transport beds, chairs,
and other furniture items from the factory to the warehouse. This
involves going through several cities. Ray would like to find the route
with the shortest distance. The road network is shown in the following
figure:

40 / 49
First iteration:

41 / 49
Second iteration:

42 / 49
Third iteration:

43 / 49
Fourth iteration:

44 / 49
Bài tập
Transworld Moving has been hired to move the office furniture and equipment of Cohen Properties
to their new headquarters. What route do you recommend? The network of roads is shown in the
following figure.

45 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46
. / 49
Bài tập

47 / 49
Solution: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
......................................................................................
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .48
. / 49
THANK YOU for YOUR ATTENTION

49 / 49