Download as pdf or txt
Download as pdf or txt
You are on page 1of 10

2022-2023

Operations Research.

Lecture Five
-Transportation problem.
- North-west corner method.
- Lowest cost method.
- Vogel method.

Asst. Lect. Hiba Dhaher


University of Technology
Electrical engineering depart.
Transportation problem
1- Introduction
Transportation is a type of (LPP) in which the transportation cost is minimized. In
transportation problem, there are different sources from which the materials are
supplied to some fixed destinations at minimum cost.

2- Methods for Initial Basic Feasible Solution


Some simple methods to obtain the initial basic feasible solution are
1. North-West –Corner- Method.
2. Lowest Cost Entry Method (Matrix Minima Method).
3. Vogel’s Approximation Method (Unit Cost Penalty Method).

2-1- North-West–Corner Method.

Step 1
- The first assignment is made in the cell occupying the upper left-hand (north-
west) corner of the table.
- The maximum possible amount is allocated here i.e. x11 = min (a1, b1). This
value of x11 is then entered in the cell (1,1) of the transportation table.

Step 2
- If b1 > a1, move vertically downwards to the second row and make the second
allocation of amount x21 = min (a2, b1 - x11) in the cell (2, 1).
- If b1 < a1, move horizontally right side to the second column and make the second
allocation of amount x12 = min (a1 - x11, b2) in the cell (1, 2).
- If b1 = a1, there is tie for the second allocation. One can make a second allocation
of magnitude x12 = min (a1 - a1, b2) in the cell (1, 2) or x21 = min (a2, b1- b1) in
the cell (2, 1)
Step 3
Start from the new north-west corner of the transportation table and repeat steps 1
and 2 until all the requirements are satisfied.

1
Example 1
Find the initial basic feasible solution by using North-West Corner method.

D
S D1 D2 D3 D4 Supply
19 30 50 10 7
S1

7 30 40 60 9
S2
0
4 8 70 20 18
S3
0
Demand 5 8 7 14 34

Solution:
D
S D1 D2 D3 D4 Supply
S1 19 30 50 10 7 2 0
5 2
S2 7 30 40 60 9 3 0
0 6 3
S3 4 8 70 20 18 14 0
0 4 14
Demand 5 6 7 14 34
0 4 0
0

The transportation cost is 5 (19) + 2 (30) + 6 (30) + 3 (40) + 4 (70) + 14 (20) =1015 $

2
Example 2
Calculate transportation cost using west-corner method.
D
S
D1 D2 D3 D4 Supply

S1 1 5 3 3 34

S2 3 3 1 2 15
9
0 2 2 3
S3
9 9 9 9
S4 2 7 2 4 12
9
Demand 21 25 17 17 19

Solution:
D D1 D2 D3 D4
Supply
S
S1 1 5 3 3 13 0
34
21 13
S2 3 3 1 2 3 0
15
9 12 3
0
S3 0 2 2 3 0
12
9 12 14
S4 2 7 2 4 17
19
9 9 9 2 9 17
Demand 21 25 17 17 80
0 12 14 0
0 2
0

The transportation cost is 21 (1) + 13 (5) + 12 (3) + 3 (1) + 12 (2) + 2 (2) + 17 (4) =
221 $

3
2-2 Lowest Cost Entry Method (Matrix Minima Method)
Step 1
Determine the smallest cost in the cost matrix of the transportation table. Allocate xij
= min (ai,bj) in the cell (i, j)
Step 2
- If xij = ai, cross out the ( ith) row of the table and decrease bj by ai. Go to step 3.
- If xij = bj, cross out the ( jth )column of the table and decrease ai by bj. Go to step
3.
- If xij = ai = bj, cross out the ( ith ) row or ( jth ) column but not both.
Step 3
Repeat steps 1 and 2 for the resulting reduced transportation table until all the
requirements are satisfied. Whenever the minimum cost is not unique, make an
arbitrary choice among the minima.

Example 3
Find the initial basic feasible solution using Matrix Minima method

D
S D1 D2 D3 D4 Supply

S1 19 30 50 10 7

70 30 40 60
S2 9

40 8 7 20
S3 18
0 9
Demand 5 8 7 14

Solution:
D Supply
D1 D2 D3 D4
S
19 30 7
50 10
S1 7 0

70 30 40
S2 2 7 60 9 2 0
9
40 3 8 70 20 18 10 3
S3
9 8 9 9 7 0
5 8 7 14
2 0 0 7
Demand
0 0

4
The transportation cost is 7 (10) + 2 (70) + 7 (40) + 3 (40) + 8 (8) + 7 (20) =814$

Example 4: find the initial solution for the following transportation


problem, by using least cost method

Supply
D1 D2 D3 D4 D5
D
S
2 11 10 3 7
S1 4

1 4 7 2 1
S2 9 8

3 9 4 12
S3 8 9
9 9 9
3 3 4 5 6
Demand

Solution:

Supply
D D1 D2 D3 D4 D5
S
2 11 10 3 7
S1 4 0
4

1 4 7 1
2
S2 9 8 3 0
3
5
3 9 4 12 9 5 4
S3 8
9 9 9 1 1 0
3 4 1
3 3 4 5 6
Demand 0 0 0 1 1
0 0

The transportation cost is 3 (4) + 3 (1) + 5 (1) + 3 (9) + 4 (4) + 8 (1)+12(1) =83 $

5
‫‪2-3 Vogel method‬‬

‫‪Example 5‬‬
‫‪Find the initial solution for the following transportation problem, by using‬‬
‫‪Vogel method‬‬

‫‪D‬‬ ‫‪Supply‬‬
‫‪D1‬‬ ‫‪D2‬‬ ‫‪D3‬‬ ‫‪D4‬‬ ‫‪D5‬‬
‫‪S‬‬
‫‪15‬‬ ‫‪7‬‬ ‫‪21‬‬ ‫‪19‬‬ ‫‪15‬‬ ‫‪400‬‬
‫‪S1‬‬

‫‪11‬‬ ‫‪23‬‬ ‫‪17‬‬ ‫‪18‬‬ ‫‪21‬‬ ‫‪600‬‬


‫‪S2‬‬
‫‪9‬‬
‫‪13‬‬ ‫‪9‬‬ ‫‪19‬‬ ‫‪17‬‬ ‫‪15‬‬ ‫‪925‬‬
‫‪S3‬‬
‫‪9‬‬
‫‪19‬‬ ‫‪2‬‬ ‫‪25‬‬ ‫‪13‬‬ ‫‪23‬‬ ‫‪475‬‬
‫‪S4‬‬
‫‪9‬‬ ‫‪7‬‬
‫‪Demand‬‬ ‫‪600‬‬ ‫‪500‬‬ ‫‪750‬‬ ‫‪350‬‬ ‫‪200‬‬ ‫‪2400‬‬

‫‪Solution:‬‬

‫‪ -‬انخطىج االونى‪ٌ :‬رم طزح اقم كهفرٍه مه كم صف ومه كم عمىد‬

‫‪D‬‬
‫‪D1‬‬ ‫‪D2‬‬ ‫‪D3‬‬ ‫‪D4‬‬ ‫‪D5‬‬ ‫‪Supply‬‬ ‫وىاذج طزح‬
‫‪S‬‬
‫‪S1‬‬ ‫‪15‬‬ ‫‪7‬‬ ‫‪21‬‬ ‫‪19‬‬ ‫‪15‬‬ ‫‪400‬‬ ‫‪8‬‬

‫‪S2‬‬ ‫‪1‬‬ ‫‪23‬‬ ‫‪17‬‬ ‫‪18‬‬ ‫‪21‬‬ ‫‪600‬‬ ‫‪6‬‬


‫‪1‬‬
‫‪S3‬‬ ‫‪1‬‬ ‫‪9‬‬ ‫‪19‬‬ ‫‪17‬‬ ‫‪15‬‬ ‫‪925‬‬ ‫‪4‬‬
‫‪3‬‬
‫‪S4‬‬ ‫‪1‬‬ ‫‪27‬‬ ‫‪25‬‬ ‫‪13‬‬ ‫‪23‬‬ ‫‪475‬‬ ‫‪6‬‬
‫‪9‬‬ ‫‪7‬‬
‫‪600‬‬ ‫‪500‬‬ ‫‪750‬‬ ‫‪350‬‬ ‫‪200‬‬ ‫‪2400‬‬
‫‪Demand‬‬
‫وىاذج طزح‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪0‬‬

‫‪ -‬انخطىج انثاوٍح ٌرم اخرٍار اكثز قٍمح مه قٍم وىاذج انطزح نهصفىف واالعمذج سىٌا ومه ثم ٌرم انعمم عهى‬
‫انعمىد او انصف انمقاتم نها(والحظ ان اكثز قٍمح هً ‪ 8‬نذنك سىف ٌرم انعمم عهى انصف ‪)S1‬‬

‫‪6‬‬
‫‪D‬‬
‫‪D1‬‬ ‫‪D2‬‬ ‫‪D3‬‬ ‫‪D4‬‬ ‫‪D5‬‬
‫‪S‬‬ ‫‪Supply‬‬ ‫وىاذج طزح‬
‫‪15‬‬ ‫‪7‬‬ ‫‪400‬‬ ‫‪21‬‬ ‫‪19‬‬ ‫‪15‬‬
‫‪S1‬‬ ‫‪400 0‬‬ ‫‪8‬‬

‫‪1‬‬ ‫‪23‬‬ ‫‪17‬‬ ‫‪18‬‬ ‫‪21‬‬


‫‪S2‬‬ ‫‪600‬‬ ‫‪6‬‬
‫‪1‬‬
‫‪1‬‬ ‫‪9‬‬ ‫‪19‬‬ ‫‪17‬‬ ‫‪15‬‬
‫‪S3‬‬ ‫‪925‬‬ ‫‪4‬‬
‫‪3‬‬
‫‪1‬‬ ‫‪27‬‬ ‫‪25‬‬ ‫‪13‬‬ ‫‪23‬‬
‫‪S4‬‬ ‫‪475‬‬ ‫‪6‬‬
‫‪9‬‬ ‫‪7‬‬
‫‪600‬‬ ‫‪500‬‬ ‫‪750‬‬ ‫‪350‬‬ ‫‪200‬‬
‫‪2400‬‬
‫‪Demand‬‬ ‫‪100‬‬

‫وىاذج طزح‬ ‫‪2‬‬ ‫‪5‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪0‬‬

‫‪ -‬انخطىج انثانثح ٌرم اخذ اقم كهفح فً انصف ‪ S1‬وٌرم انعمم عهٍها تاسهىب انعزض وانطهة كما فً طزٌقح‬
‫انزكه انشمانً وطزٌقح اقم كهفح‪.‬‬

‫‪ -‬والحظ ان قٍمح ‪S1‬اصثحد صفز وهذا ٌعىً وفاخ انمىرجاخ او انثضائع مه انمصىع او شزكح انرجهٍز ‪S1‬‬
‫نذنك ٌرم حذفه‬

‫‪D‬‬
‫‪D1‬‬ ‫‪D2‬‬ ‫‪D3‬‬ ‫‪D4‬‬ ‫‪D5‬‬ ‫‪Supply‬‬ ‫وىاذج طزح‬
‫‪S‬‬
‫‪1‬‬ ‫‪600‬‬ ‫‪23‬‬ ‫‪17‬‬ ‫‪18‬‬ ‫‪21‬‬
‫‪S2‬‬ ‫‪600 0‬‬ ‫‪6‬‬
‫‪1‬‬
‫‪S3‬‬ ‫‪1‬‬ ‫‪9‬‬ ‫‪19‬‬ ‫‪17‬‬ ‫‪15‬‬ ‫‪925‬‬ ‫‪4‬‬
‫‪3‬‬
‫‪S4‬‬ ‫‪1‬‬ ‫‪27‬‬ ‫‪25‬‬ ‫‪13‬‬ ‫‪23‬‬ ‫‪475‬‬ ‫‪6‬‬
‫‪9‬‬
‫‪600‬‬ ‫‪500‬‬ ‫‪750‬‬ ‫‪350‬‬ ‫‪200‬‬
‫‪2400‬‬
‫‪Demand‬‬ ‫‪0‬‬ ‫‪000‬‬

‫وىاذج طزح‬ ‫‪2‬‬ ‫‪5‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪0‬‬

‫‪ٌ -‬رم ذكزار انخطىاخ انساتقح حٍث ٌرم اخذ اكثز قٍمح مه ذىاذج انطزح ثم ٌطثق اسهىب انعزض وانطهة عهى‬
‫انصف او انعمىد انمقاتم نرهك انقٍمح‬

‫‪7‬‬
‫‪D‬‬
‫‪D2‬‬ ‫‪D3‬‬ ‫‪D4‬‬ ‫‪D5‬‬ ‫‪Supply‬‬ ‫وىاذج طزح‬
‫‪S‬‬
‫‪9‬‬ ‫‪19‬‬ ‫‪17‬‬ ‫‪15‬‬
‫‪S3‬‬ ‫‪925‬‬ ‫‪4‬‬

‫‪27‬‬ ‫‪25‬‬ ‫‪13‬‬ ‫‪350‬‬ ‫‪23‬‬


‫‪S4‬‬ ‫‪475 125‬‬ ‫‪6‬‬

‫‪500‬‬ ‫‪750‬‬ ‫‪350‬‬ ‫‪200‬‬


‫‪2400‬‬
‫‪Demand‬‬ ‫‪000‬‬ ‫‪0‬‬

‫وىاذج طزح‬ ‫‪5‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪0‬‬

‫‪D‬‬
‫‪D2‬‬ ‫‪D3‬‬ ‫‪D5‬‬ ‫‪Supply‬‬
‫‪S‬‬
‫‪S3‬‬ ‫‪9‬‬ ‫‪100‬‬ ‫‪19‬‬ ‫‪625‬‬ ‫‪15‬‬ ‫‪200‬‬ ‫‪925‬‬ ‫‪825‬‬ ‫‪625 0‬‬ ‫‪4‬‬
‫‪27‬‬ ‫‪25‬‬ ‫‪125‬‬ ‫‪23‬‬
‫‪S4‬‬ ‫‪475 125 0‬‬ ‫‪6‬‬

‫‪500‬‬ ‫‪750‬‬ ‫‪200‬‬


‫‪2400‬‬
‫‪Demand‬‬ ‫‪000‬‬ ‫‪125‬‬ ‫‪0‬‬
‫‪0‬‬ ‫‪0‬‬
‫وىاذج طزح‬ ‫‪5‬‬ ‫‪2‬‬ ‫‪0‬‬

‫‪ -‬عىذ انىصىل انى عذد مرساوي او مرقارب مه انمصاوع ومزاكز انرجهٍز ٌرم انرىقف عه انحذف واخرٍار‬
‫اقم كهفح مه تٍه انكهف انمىجىدج وانعمم عهٍها(كما فً طزٌقح اقم كهفح) ‪.‬‬

‫‪Transportation cost = 400 × 7 + 600 × 11 + 350×13+ 100 × 9 + 625 × 19 + 200 × 15‬‬


‫)‪+ 125 × 25= 32,850 $.‬‬

‫‪8‬‬
Problem

Find the initial solution for the following transportation problem, by using
1- North-west corner method Vogel method.
2- Least cost method.
3- Vogel method.
4- Find the best method among them.

D
D1 D2 D3 D4 Supply
S
S1 10 20 5 7 10

S2 13 9 12 8 20
9
S3 4 15 7 9 30
9
S4 14 7 1 0 40
9
S5 3 12 5 19 50
9
Demand 60 60 20 10 34

You might also like