Documente Academic
Documente Profesional
Documente Cultură
Copyright@sjmsomiitbombay2016
Transportation Problems
Copyright@sjmsomiitbombay2016
Copyright@sjmsomiitbombay2016
P &G makes and markets over 300 brands of consumer goods worldwide.
To maintain and accelerate its growth, a major OR study was undertaken
to strengthen P&Gs global effectiveness. Prior to the study, the companys
supply chain consisted of hundred of suppliers, over 50 product categories,
over 60 plants, 15 distribution centers, and over 1000 customers zones.
However, as the company moved toward global brands, management
realized that it needed to consolidate plants to reduce manufacturing
expanses, improve speed market, and reduce capital investment.
Therefore, the study focused on redesigning the companys production and
distribution system for its North American Operations. The result was a
reduction in the number of North American Plants by almost 20 percent,
savings $200 million in pretax cost per year.
A major part of the study revolved around formulating and solving
transportation problems for individual product categories. For each option
regarding the plants to keep open, and so forth, solving the corresponding
transportation problem for a product category showed what the distribution
cost would be for shipping the product category from those plants to the
distribution centers and customer zones. Sources: Interfaces, vol. 27, 1997.
Copyright@sjmsomiitbombay2016
Source
s
1
2
3
61
69
59
72
78
66
45
60
63
55
49
61
66
56
47
31
36
38
43
33
24
28
36
24
32
35
31
26
Copyright@sjmsomiitbombay2016
Sources
1
2
3
275
293
303
318
283
238
270
275
250
268
285
265
240
Considering the expected useful life of the ships and the time value of money, the
equivalent uniform annual cost of these investments is one-tenth the amount given in the
table. The objective is to determine the overall shipping plan that minimizes the total
equivalent uniform annual cost (including shipping costs).
Copyright@sjmsomiitbombay2016
Copyright@sjmsomiitbombay2016
Copyright@sjmsomiitbombay2016
Copyright@sjmsomiitbombay2016
10
The
As
S d
j 1
Copyright@sjmsomiitbombay2016
11
12
Copyright@sjmsomiitbombay2016
13
14
+x21
+x22
x13
+x23
x14
+x24
Xij > 0 ( i = 1,2,3; j = 1,2,3,4)
Copyright@sjmsomiitbombay2016
x31+x32+x33+x34
+x31
+x32
+x33
+x34
= 75
= 125
= 100
= 80
= 65
= 70
= 85
15
x11 x12 x13 x14 x21 x22 x23 x24 x31 x32 x33 x34
1
1
1
1
75 =
75
1
1
1
1
125 = 125
1
1
1
1 100 = 100
1
1
1
80 =
80
1
1
1
65 =
65
1
1
1
70 =
70
1
1
1 85 =
85
Objective 464 513 654 867 352 416 690 791 995 682 388 685
Min 152535
Solution
20
55
80
45
Copyright@sjmsomiitbombay2016
70
30
16
Example-2
1 35 million;
2 50 million;
3 40 million.
1 45 million;
2 20 million;
City 3 30 million;
City 4 30 million.
Copyright@sjmsomiitbombay2016
17
Example 2
18
L P Formulation
xij: number of (million) kwh produced at plant i and sent to
city j
Min Z = 8x11+ 6x12+10x13+ 9x14
+ 9x21+ 12x22+ 13x23+ 7x24
+ 14x31+ 9x32+ 16 x33+ 5x34
Subject to:
x11+x12+x13+x14 = 35
x21+x22+x23+x24 = 50
x31+x32+x33+x34 = 40
x11+x21+x31 = 45
x12+x22+x32 = 20
x13+x23+x33 = 30
x14+x24+x34 = 30
Xij > 0 i = 1,2,3 j = 1,2,3,4
Copyright@sjmsomiitbombay2016
19
Example 2
Solution: Example 2
constraints
x11 x12 x13 x14 x21 x22 x23 x24 x31 x32 x33 x34
1
1
1
1
35
1
1
1
1
50
1
1
1
1 40
1
1
1
45
1
1
1
20
1
1
1
30
1
1
1 30
Objective
function
10
12
13
14
16
Solution
10
25
45
10
30
Copyright@sjmsomiitbombay2016
=
=
=
=
=
=
=
35
50
40
45
20
30
30
Min 1020
20
Copyright@sjmsomiitbombay2016
21
Which new location will yield the lowest cost for the firm
Copyright@sjmsomiitbombay2016
22
WAREHOUSE
MONTHLY
DEMAND
(UNITS)
PRODUCTION
PLANT
MONTHLY
SUPPLY
COST TO PRODUCE
ONE UNIT ($)
Detroit
10,000
Cincinnati
15,000
48
Dallas
12,000
Salt Lake
6,000
50
New York
15,000
Pittsburgh
14,000
52
Los Angeles
9,000
35,000
46,000
Supply needed from new plant = 46,000 35,000 = 11,000 units per month
Seattle
$53
Birmingham
$49
Copyright@sjmsomiitbombay2016
23
LOS
ANGELES
DETROIT
DALLAS
NEW YORK
CINCINNATI
$25
$55
$40
$60
SALT LAKE
35
30
50
40
PITTSBURGH
36
45
26
66
SEATTLE
60
38
65
27
BIRMINGHAM
35
30
41
50
Copyright@sjmsomiitbombay2016
24
DETROIT
10,000
103
1,000
88
PITTSBURGH
84
BIRMINGHAM
WAREHOUSE
REQUIREMENT
73
85
SALT LAKE
DALLAS
10,000
12,000
88
1,000
80
97
11,000
NEW YORK
100
14,000
79
15,000
Copyright@sjmsomiitbombay2016
LOS
ANGELES
4,000
108
90
5,000
78
118
90
99
9,000
FACTORY
CAPACITY
15,000
6,000
14,000
11,000
46,000
25
Copyright@sjmsomiitbombay2016
26
Copyright@sjmsomiitbombay2016
27
DETROIT
10,000
73
4,000
85
SALT LAKE
103
6,000
88
PITTSBURGH
10,000
2,000
12,000
NEW YORK
91
88
108
100
90
78
118
1,000
80
97
113
SEATTLE
WAREHOUSE
REQUIREMENT
DALLAS
LOS
ANGELES
14,000
118
15,000
Copyright@sjmsomiitbombay2016
9,000
9,000
80
FACTORY
CAPACITY
15,000
6,000
14,000
11,000
46,000
28
$3,741,000
The Seattle location yields a total system cost of
$3,704,000
With the lower total system cost, the Seattle location is
favored
Copyright@sjmsomiitbombay2016
29
30
Demand
50
70
85
75
The regular production capacity for each period is 60 units while with overtime
working, an additional of upto 20 units can be produced in each period. The
unit cost of production in regular time is worked out to be Rs 6 whereas it
would cost Rs 10 per unit for the items manufactured during overtime. You
may assume that the cost would be identical in all the periods. Any production
in excess of the requirement in the current period may be held at a cost of Rs
3 per unit per period. No holding cost is involved if a unit is sold in the period
in which it is produced.
(a) Formulate the problem as a transportation problem; and
(b) Draw the optimal production plan for the manufacturer
Copyright@sjmsomiitbombay2016
31
Origin
Destination
Supply
R1
12
15
60
O1
10
13
16
19
20
R2
12
60
O2
10
13
16
20
R3
60
O3
10
13
20
R4
60
O4
10
20
Demand
50
70
85
75
40
320
32
Solution: Optimal
Origin
Destination
Supply
R1
6 (50)
9 (10)
12
15
60
O1
10
13
16
19
0 (20)
20
R2
6 (60)
12
60
O2
10
13 (5)
16
0 (15)
20
R3
6 (60)
60
O3
10 (20)
13
20
R4
6 (60)
60
O4
10 (15)
0 (5)
20
Demand
50
70
85
75
40
320
33
R
O.T.
60
nil
R
O.T.
60
5
R
O.T.
60
20
R
O.T.
60
15
Demand
50
10
60
5
60
20
60
15
50
70
85
75
Copyright@sjmsomiitbombay2016
34
Unit Cost of
Production ($million)
Unit Cost
of Storage(*)
($thousand)
Month
Scheduled
Installations
10
25
1.08
15
15
35
1.11
15
25
30
1.10
15
20
10
1.13
Question: How many engines should be produced in each of the four months so that
the total of the production and storage costs will be minimized?
(*) storage cost is incurred at the end of the month for just those engines that are being held over to
35
Copyright@sjmsomiitbombay2016
the next month;
if i < j
if i >j
???
si = ??
Copyright@sjmsomiitbombay2016
36
(installation
in month j)
Source
(production
in month i)
SUPLLY
1.080
1.095
1.110
1.125
1.110
1.125
1.140
1.100
1.115
1.130
Demand
10
15
25
30
Question: How many engines should be produced in each of the four months so
that the total of the production and storage costs will be minimized?
(*) storage cost is incurred at the end of the month for just those engines that are being held over to
37
Copyright@sjmsomiitbombay2016
the next month;
1.080
1.095
1.110
1.125
25
1.110
1.125
1.140
35
1.100
1.115
30
1.130
10
Demand
10
15
25
20
30
5(D)
(*) SUPLLY
(*) The dummy destination can be seen as a slack variable that represents the
unused production capacity. Cost is zero because it is the cost of distributing to a
fictional destination. Note that it would be inappropriate to assign M since we do
not want to force the corresponding values to be zero. In fact these values need
to sum 30.
Copyright@sjmsomiitbombay2016
38
Copyright@sjmsomiitbombay2016
39
Example
Copyright@sjmsomiitbombay2016
40
Example
Table: Sunray Transportation Model.
Mill
2
10
3
2
4
20
Supply
11
15
x11
x12
x13
12
Silo
x14
20
25
x21
x22
x23
x24
14
16
18
10
x31
Demand
x32
5
x33
15
x34
15
Copyright@sjmsomiitbombay2016
15
41
Step-2: Cross out the row or column with zero supply or demand to
indicate that no further assignments can be made in that row or
column. If both a row and a column net to zero simultaneously,
cross out one only, and leave a zero supply (demand) in the
uncrossed-out row (column).
Copyright@sjmsomiitbombay2016
42
2
10
4
20
11
15
7
5
4
9
15
14
20
5
16
3
Demand
15
15
Copyright@sjmsomiitbombay2016
25
18
10
5
Supply
10
12
Silo
10
15
43
Step-2: Identify the row or column with the largest penalty. Break
ties arbitrarily. Allocate as much as possible to the variable with the
least unit cost in the selected row or column. Adjust the supply and
demand, and cross out the satisfied row or column. If a row and a
column are satisfied simultaneously, only one of the two is crossed
out, and the remaining row (column) is assigned zero supply
(demand).
Copyright@sjmsomiitbombay2016
44
45
2
10
Colmn
Penalty
14
20
10
16
5
15
6
----
15
5
5
---
2 11 20
25, 10
18
5
I
II
III
IV
11
9
15
Demand
20
Supply
15
15
12
Silo
Row Penalty
I II III IV
8 9 -- --
10 2
2 18
10, 5
15, 5
7
7
7
--
Copyright@sjmsomiitbombay2016
7
7
2
2
46
Example 4
Demand
D1
D2
D3
D4
Supply
O1
30
O2
50
O3
20
20
40
30
10
Copyright@sjmsomiitbombay2016
47
Example 4
D1
D2
D3
D4
O1
30
10
O2
50
2
O3
Demand
Colum n Penalty
20
40
30
10
20
Copyright@sjmsomiitbombay2016
48
Example 4
D1
O1
D2
D3
D4
Demand
Colum n Penalty
20
40
30
10
0 20
50 40
20
O3
30
10
O2
20
3
--
Copyright@sjmsomiitbombay2016
49
Example 4
D1
D2
D3
D4
20
O1
0
1
1
1
Demand
Colum n Penalty
20
40
30
10
2 20
0 20
1 30
--
--
Copyright@sjmsomiitbombay2016
--
50 40
20
O3
30 30
10
O2
20
50
Example 4
D1
D2
20
O1
D3
D4
10
1
0
1
1
1
Demand
Colum n Penalty
--
20
40
30
10
0 20
--
--
1 20
--
--
--
50 40
20
O3
30 10
10
O2
20
Copyright@sjmsomiitbombay2016
51
Example 4
D1
D2
20
O1
D4
10
1
2
20
O2
D3
0
1
20
3
1
1
Demand
Colum n Penalty
--
20
40
30
10
0 20
--
--
1 20
--
--
--
50 40
20
O3
30 10
10
2
20
Copyright@sjmsomiitbombay2016
52
basic,
53
Step 3:
Determine the entering basic variable:
Select the nonbasic variable xij having the largest negative
value of cijuivj.
Determine the leaving basic variable:
Identify the chain reaction required to retain feasibility
when the entering basic variable is increased. From the
donor cells, select the basic variable having the smallest
value.
Determine the new basic feasible solution.
Add the value of the leaving basic variable to the allocation
for each recipient cell. Subtract this value from the
allocation for each donor cell.
Go to step 2.
Copyright@sjmsomiitbombay2016
54
Interpretation
vj: Multiple of original row m+j that has been subtracted from
original row 0 by the simplex method during all iterations
leading to the current simplex table.
Copyright@sjmsomiitbombay2016
55
Example 5
Demand
D1
D2
D3
O1
O2
O3
O4
14
18
Copyright@sjmsomiitbombay2016
Supply
56
D2
D3
Supply
-1
-2
14
ui
5
O1
8
O2
3
7
O3
5
2
O4
Demand
vj
10
18
Copyright@sjmsomiitbombay2016
57
D2
0
Supply ui
2
3
D3
-1
-2
14
-2
8
O2
7
7
O3
5
2
O4
Demand
vj
4
2
10
18
Copyright@sjmsomiitbombay2016
58
Example 5
D1
5
O1
0
2
3
O2
Supply
14
Demand
O3
D3
1
O4
D2
7
4
12
18
Copyright@sjmsomiitbombay2016
59
Copyright@sjmsomiitbombay2016
60
Demand
D1
D2
D3
O1
60
O2
70
O3
11
80
50
80
80
Copyright@sjmsomiitbombay2016
Supply
61
62
No
Is it
balanced?
Yes
Is it a
maximization
problem?
Yes
No
Find its initial basic feasible solution
using NWC rule, VAM etc.
Is it a
degenerate?
Yes
No
No
Is it a
optimal?
Yes
The problem is solved
Stop
Copyright@sjmsomiitbombay2016
63
Transshipment Problems
Copyright@sjmsomiitbombay2016
64
Transshipment Problems
The transshipment model recognizes that it
may be cheaper to ship through intermediate or
transient nodes before reaching the final
destination.
Transshipment model can be converted to a
regular transportation model using the idea of
a buffer.
Copyright@sjmsomiitbombay2016
65
Transshipment Problems
66
Copyright@sjmsomiitbombay2016
67
Data:
Farm
1. Nebrasca
2. Colorado
3. Kansas City
$16
15
Grain Elevator
4. Omaha
10
14
Copyright@sjmsomiitbombay2016
5. Des Moines
12
17
68
68
69
Copyright@sjmsomiitbombay2016
70
70
Copyright@sjmsomiitbombay2016
71
Copyright@sjmsomiitbombay2016
72
Copyright@sjmsomiitbombay2016
73
74
The Problem. The Distribution Unlimited Co. will be producing the same new
product at two different factories, and then the product must be shipped to two
warehouses, where either factory can supply either warehouse. The distribution
network available for shipping this product is shown in DN Fig. , where F1 and F2
to are the two factories, W1 and W2 are the two warehouses, DC is a distribution
center. The amounts to be shipped from F1 and F2 are shown to their left, and the
amounts to be received at W1and W2 are shown to their right. Each arrow
represents a feasible shipping lane. Thus, F1can ship directly to W1 and has three
possible routes (F1->DC-> W2, F1->F2->DC->W2, and F1->W1->W2) for
shipping toW2. Factory F2 has just one route to W2 (F2->DC->W2) and one to W1
(F2->DC->W2->W1).The cost per unit shipped through each shipping lane is
shown next to the arrow. Also shown next to F1->F2 and DC->W2 are the
maximum amounts that can be shipped through these lanes. The other lanes have
sufficient shipping capacity to handle everything these factories can send.
The decision to be made concerns how much to ship through each shipping lane.
The objective is to minimize the total shipping cost.
Copyright@sjmsomiitbombay2016
The decision to be made concerns how much to ship through each shipping
lane. The objective is to minimize the total shipping cost.
Copyright@sjmsomiitbombay2016
75
Non-negativity constraints
Copyright@sjmsomiitbombay2016
76
= 50 (factory 1)
+ XF2-DC
- XF1-DC
= 40 (factory 2)
- XF2-DC + XDC-W2
- XF1-W1
= 0 (distribution center)
+ XW1-W2 - XW2-W1 = -30
(warehouse 1)
Copyright@sjmsomiitbombay2016
77
Solution:
XF1-F2 =0, XF1-DC =40,
Copyright@sjmsomiitbombay2016
78
Test Problem
Two automobile plants, P1 and P2, are linked to three
dealers, D1, D2, and D3, by way of two transit centers, T1
and T2m according to network shown in the following SC
network. The supply amounts at plants P1 and P2 are 1000
and 1200 cars, and the demand at dealers D1, D2 and D3 are
800,900 and 500 cars. The shipping costs per car in hundreds
of dollars between pairs of nodes are shown on connecting
links (or arcs) of the network.
Copyright@sjmsomiitbombay2016
79
Test Problem
800
D1
8
3
1000
T1
P1
6
4
7
900
D2
2
1200
P2
3
T2
D3
500
Copyright@sjmsomiitbombay2016
80
Assignment Problems
Copyright@sjmsomiitbombay2016
81
The American League is composed of 14 professional baseball teams organized into three
divisions. The game schedule, constructed each winter prior to the start of the baseball
season, is a different scheduling problem in itself. Consideration must be given to such
factors as the number of games played against other teams, both within and outside a
division, the split between home games and road trips, travel time, and possible conflicts in
cities that have teams in the National League.
The objective of balancing crew assignments relatively evenly and minimizing travel costs
are by nature conflicting, Attempting to balance crew assignments necessitates considerable
airline travel and equipment moves, and hence increased travel costs.
Using an assignment model as part of a micro computer-based decision support system, the
American League was able to reduce travel mileage by about 4% during the first year of use.
This not only saved the league $30, 000 but improved the crew exposure balance.
Source: Interface, 1988
Copyright@sjmsomiitbombay2016
82
Examples
Copyright@sjmsomiitbombay2016
83
Assumptions:
- The number of assignees and the number of tasks are the
same.
- Each assignee is to be assigned to exactly one task.
-
84
Assignment Problem
Copyright@sjmsomiitbombay2016
85
Copyright@sjmsomiitbombay2016
86
Job Assignment
A Production supervisor is considering how he should assign the four jobs
that are to be performed, to four of the workers. He wants to assign the
jobs to the workers such that the aggregate time to perform the jobs is the
least. Based on previous experience, he has the information on the time
taken by the four workers in performing these jobs, as given in the table
below:
Worker
Job
A
45
40
51
67
57
42
63
55
49
52
48
64
41
45
60
55
Copyright@sjmsomiitbombay2016
87
x11+x21+x31 +X41= 1
x12+x22+x32 +x42= 1
x13+x23+x33 + x43 = 1
x14+x24+x34 + x44 = 1
Xij ={0,1}, i = 1,2,3,4 j = 1,2,3,4
Copyright@sjmsomiitbombay2016
88
88
Job Assignment
Solution
Constraints
x11 x12 x13 x14 x21 x22 x23 x24 x31 x32 x33 x34 x41 x42 x43 x44
1 1 1 1
1
1 1 1 1
1
1 1 1 1
1
1 1 1 1 1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1 1
Objective
45 40 51 67 57 42 63 55 49 52 48 64 41 45 60 55
Solution
Copyright@sjmsomiitbombay2016
=
=
=
=
=
=
=
=
1
1
1
1
1
1
1
1
Min 184
89
Basic Principle
j
n
j 1
s.t.
n
xi
j 1
i
Copyright@sjmsomiitbombay2016
90
Hungarian Algorithm
Copyright@sjmsomiitbombay2016
91
Hungarian Algorithm
Copyright@sjmsomiitbombay2016
92
Hungarian Algorithm
93
Example
Machines
M1
M2
M3
M4
J1
26
17
11
J2
13
28
26
J3
38
19
18
15
J4
19
26
24
10
JOBS
Copyright@sjmsomiitbombay2016
94
Example
Machines
M1
M2
M3
M4
J1
18
J2
24
22
J3
23
J4
16
14
JOBS
Copyright@sjmsomiitbombay2016
95
Example
Machines
M1
M2
M3
M4
J1
14
J2
20
22
J3
23
J4
12
14
JOBS
Copyright@sjmsomiitbombay2016
96
M1
M2
M3
M4
J1
14
J2
20
22
J3
23
J4
12
14
JOBS
Copyright@sjmsomiitbombay2016
97
98
Example
Table- 1: Maximization problem
I
II
II
Copyright@sjmsomiitbombay2016
99
Example
Copyright@sjmsomiitbombay2016
100
Example
Table- 1: Cost data
Job
J1
J2
J3
J4
50
50
20
70
40
20
30
90
30
50
70
20
60
70
Worker
Copyright@sjmsomiitbombay2016
101
Example
Table- 1: Cost data
Job
J1
J2
J3
J4
50
50
20
70
40
20
30
90
30
50
70
20
60
70
Worker
Copyright@sjmsomiitbombay2016
102
Start
No
Is it
balanced?
Yes
Is it a
maximization
problem?
Yes
No
Obtain reduced cost tables:
(i) Subtract from all entries in each row the least
value in the row
(ii) From this table, subtract from all entries in
each column the least value in the column
No
Yes
Make assignments on
one-to-one match basis
considering zeroes in
rows/columns.
Stop
Copyright@sjmsomiitbombay2016
103