Académique Documents
Professionnel Documents
Culture Documents
Supp
ly
S1
11
13
17
14
250
S2
16
18
14
10
300
S3
21
24
13
10
400
Deman
d
20
0
225
275
250
D2
D3
D4
Suppl
y
S1
11(200)
13(50)
17
14
250
S2
16
18(17
5)
14(125
)
10
300
S3
21
24
13(150
)
10(250
)
150
Deman
200 of allocation
225
275
Here,
the number
is
equal to250
m+n-1=3+4
-1d
= 6
The solution is feasible.
Total Transportation cost = 11 200 + 13 50 + 18 175
+ 14 125 + 13 150 + 10 250 = 12200
The minimized total transportation cost = 12200
D2
D3
D4
Supp
ly
S1
11
13
17
14
250
S2
16
18
14
10
300
S3
21
24
13
10
400
Deman
d
20
0
225
275
250
D1
D2
D3
D4
Suppy
Penalty
S1
11(200
)
13(50)
17
14
250
2|1|--|--|--|--|
S2
16
18(175 14
)
10(125 300
)
4|4|4|4|--|--|
S3
21
24
13(275)
10(125 400
)
3|3|3|3|3|10|
Demand
200
225
275
250
Col
Penalty
5
5
1
_
5
1
_
6
1
_
_
1
_
_
13
_
_
_
Here, the number of allocation is equal
The solution is feasible.
Total Transportation cost = 11 200 +
275 + 10 125 = 12075
0
0
0
0
10
10
to m + n - 1 = 3 + 4 - 1 = 6
13 50 + 18 175 + 10 125 + 13
MODI Method
Now modi method starts....
Find Ui and Vj, Cij = Ui + Vj, for all occupied cells(i,j)
Substituting, U1= 0, we get
C11= U1+ V1 11 = 0 + V1 V1= 11 - 0 = 11
C12= U1+ V2 13 = 0 + V2 V2= 13 - 0 = 13
C22= U2+ V2 18 = U2+ 13 U2= 18 - 13 = 5
C24= U2+ V4 10 = 5 + V4 V4= 10 - 5 = 5
C34= U3+ V4 10 = U3+ 5 U3= 10 - 5 = 5
C33= U3+ V3 13 = 5 + V3 V3= 13 - 5 = 8
D1
D2
D3
D4
Suppy
Ui
S1
11(200
)
13(50)
17
14
250
S2
16
18(175 14
)
10(125 300
)
S3
21
24
13(275)
10(125 400
)
Demand
200
225
275
250
Vj
11
13
D1
D2
D3
D4
Suppy
Ui
S1
11(200
)
13(50)
17[9]
14[9]
250
S2
16[0]
18(175 14[1]
)
10(125 300
)
S3
21[5]
24[6]
13(275)
10(125 400
)
Demand
200
225
275
250
Vj
11
13
D2
D3
D4
Supply
S1
11(200)
13(50)
17
14
250
S2
16
18(175)
14
10(125)
300
S3
21
24
13(275)
10(125)
400
Demand
200
225
275
250
S1 refers to alto
S2 refers to swift
S3 refers to ritz
D1 refers to shivaji nagar
D2 refers to viman nagar
D3 refer to Aundh
Conclusion : - It shows if they increase there supply to viman nagar .
And if they meet the demand of viman nagar that will help to
decrease their cost and increase their turn over
0R ASSIGNMENT
TRANSPORATION PROBLEM TO
MINIMIZE THE TRANSPORTATION COST
OF MARUTI SUZUKI PVT LTD COMPANY
SUBMITTED BY
1) AYUSH BASANDANI PRN
_1403122017
2) DEPEESH
PRN
_14030122053
3) KAUSHIKY SHARMA PRN
_14030122005
ACKNOWLEDGEMENT
To Director SICSR Dr. Lalit Kathpalia, Deputy
Director Harshad Guney, OS, Course in charge
Prof .Rajeshree, Guide Prof. Shilpa Mujumdar.
We would also like to thank Cadbury Pvt Ltd and
specially the managing director for his help in
our work. Last but not least, our greatest
appreciation and love goes to our families and
for sure this would not have happened without
their unconditional support, love and care.
Source of data
Data is collected by survey from internet, the following are the webpages
that data was collected:
P.K Gupta, and D.S Hira, Operation Research, S. Chand Company Ltd.,
2004
http://www.diva-portal.org/smash/get/diva2:518851/fulltext01
The data is collected for period 2013-2014.
Methods
Least
Cost Method
Least cost method, we start giving allocations from the minimum
cost in the matrix. It means that cell for which cost is minimum is
given allocation first. Then allocation is given in next minimum cost
and so on. It means lower cost cells are given priority over higher