Scribd
Upload
73 views12 pages

Presented By:-: To, Prof: Samprit Chakraborty Manish Kumar

This document discusses different methods for solving transportation problems including the North-West Corner Method, Least Cost Method, and Vogel's Approximation Method (VAM). It provides steps to solve a transportation problem using VAM, which finds a basic feasible solution that is either optimal or close to optimal. The document includes a transportation problem table with supply and demand quantities and costs per unit between origins and destinations. It shows the step-by-step work to solve this problem using VAM.

Uploaded by

ajrox09
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
73 views12 pages

Presented By:-: To, Prof: Samprit Chakraborty Manish Kumar

This document discusses different methods for solving transportation problems including the North-West Corner Method, Least Cost Method, and Vogel's Approximation Method (VAM). It provides steps to solve a transportation problem using VAM, which finds a basic feasible solution that is either optimal or close to optimal. The document includes a transportation problem table with supply and demand quantities and costs per unit between origins and destinations. It shows the step-by-step work to solve this problem using VAM.

Uploaded by

ajrox09
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

To, Prof: Samprit Chakraborty

Presented by:Manish Kumar Prerna Mahansaria Nirmal Samsukha Himanshu Singh Saugat Sen Atryee Chatterjee Ashwini Pandey Swapna Agarwal

Problem are basically routine problem which deal with the supply of goods and materials from the place of origin to the place of destination The main objective of transportation problem is to satisfy the requirements of the consumers at the minimum possible transportation cost.

NORTH-WEST METHOD LEAST COST METHOD VOGELS APPROXIMATION METHOD(VAM)

VAM is an interactive procedure for computing a basic feasible solution of a transportation problem. The solution obtained by this method is either optimal or very close to the optimal solution.

1. DD = SS i.e., Total Demand equals to Total Supply 2. Find the Penalty 3. Identify the Maximum Penalty 4. If there is a tie in penalty, choose the Row or Column with the minimum cost. 5. Repeat all the above steps

DESTINATION ORIGIN O1 O2 O3 D1 20 24 32 D2 22 37 37 D3 17 9 20 D4 4 7 15 SUPPLY 120 70 50

DEMAND

60

40

30

110

240

STEP 1
We will take the cells with the minimum units in each row and column and then find out the difference between them O1 :D3-D4=17-4=13 O2 :D3-D4=9-7=2 O3 :D3-D4=20-15=5 D1 :O1-O2=24-20=4 D2 :O2-O1=37-22=15 D3 :O1-O2=17-9=8 D4 :O2-O1=7-4=3

SOLUTION
CALCULATING PENALTY FOR TABLE 1 DESTINATION ORIGIN O1 O2 O3 DEMAND PENALTY D1 20 24 32 60 4 D2 22 37 37 40 15
40

D3 17 9 20 30 8

D4 4 7 15 110 3

SUPPLY 120 70 50 240


80

PENALTY 13 2 5

The highest penalty occurs in the second column. The minimum in this column is c12 (i.e. 22). So X12=40 and the second column is eliminated.

Origin/Destination O1

D1 20

D3 17

D4 4
80

Supply 80

Penalty 13

O2
O3 Demand Penalty

24
32 60 4

9
20 30 8

7
15 110 3

70
50

2
5

Origin/Destination O2

D1 24

D3 9
30

D4 7

Supply 70

Penalty 2

O3
Demand

32
60

20
30

15
30

50

Penalty

11

Origin/Destination
O2

D1
24
10

D4
7
30

Supply
40

Penalty
17

O3
Demand Penalty

32
60 8

50

15
30 8

50

17

Origin O1 O1 O2

Destination D2 D4 D3

Unit's Transported
40 80 30

Cost/Unit 22 4 9

Total Cost 880 320 270

O2 O2
O3

D1 D4
D1

10 30
50

24 7
32

240 210
1600 3520

You might also like