Asian Journal of Current Engineering and Maths1: 3 May June (2012) 81 83.

Contents lists available at www.innovativejournal.in

ASIAN JOURNAL OF CURRENT ENGINEERING AND MATHS

Journal homepage : http://www.innovativejournal.in/index.php/ajcem

SOLVING TRANSPORTATION PROBLEM WITH THE VARIOUS METHOD

OF LINEAR
PROGRAMMING PROBLEM
Gaurav Sharma1*, S. H. Abbas2,Vijay Kumar Gupta3
1

Deptt. Of Mathematics, IES Institute Of Technology And Management, Bhopal(M.P.)

2

Deptt. Of Mathematics, Saifia Science College Bhopal(M.P.).

3

Deptt. Of Mathematics, UIT, RGPV Bhopal (M.P.)

ARTICLE INFO
Corresponding Author
Gaurav Sharma
Department of Mathematics,
IES Institute of Technology and
Management, Bhopal. India.
sharma.13g11@gmail.com

ABSTRACT
The Transportation Problem is one of the subclass of linear
programming
problem which the objective is to minimize transportation cost of
goods
transport to various origins to different destinations. In this paper
we are
representing the transportation problem for Albert David
Company to
reduce transportation cost, its working with 3 plants and 14
depots in all
over India. In [6][7] we are solve the transportation problem with
the
help of dual simplex and two phase method. Here we are solving
this
problem with the help of Dual simplex method, Two Phase method
and
Big M Method by using Tora software and we are comparing the
obtained
optimal solution with Vogel Approximation Method.

KeyWords Transportati
:
on
Problem,
Dual Simplex Method, Phase Two
Method, Big M
Method
INTRODUCTION
Transportation Problem is one of the
fundamental
problems of network flow problem which is
usually use to
minimize the transportation cost for industries
with
number of sources and number of destination
while
satisfying
supply limit
demand
the
and
requirement.
Transportati
on
Problem
firstly presented by
F.L.Hitchcock[1] in his paper The Distribution of
a Product
from Several sources to numerous Localities
and after that
its presenting by T. C. Koopmans[2] in his historic paper

Optimum Utilization of the Transportation

System. These
two contributions
developme
helped
in the nt
of

2012, AJCEM, All Right

Reserved.
FORMULATION OF TRANSPORTATION
PROBLEM IN
LINEAR PROGRAMMING PROBLEM
Given m origins and n destinations, the
transportation problem can be formulated as the
following
linear programming problem model:
Minimize:
Subject to
constraint:

=
=1 1

=1

=
1

for all i and j

i=1, 2, ..m

j=1, 2,..n

transportati metho
on
ds

involve
which a

numb
er

of

shipping sources
numb of destinations.
and a
er
In
the
recent past, Transportation Problem with a
different single
objective to minimize the duration of
transportation has
been studied by many researchers such as
Sharma and

Where
origin I to destination j
and

is the amount of units of

shipped from
is the cost of shipping
one

unit from origin i to destination j. The amount of

supply at
origin is
amou
of destination j is bj.
ai
and the
nt
The
objective is to determine the unknown xij that
will the total cost while satisfying all the
an
Tikekar[5
transportation
Swarup[8], Seshan d
],
Prakash, supply and
Papmanthou[4],and Sonia, Sonia et al[10]
demand
studied on time
constraints
transportation problem. Surapati and Roy [11],
Numerical
Wahead
Example
and Lee [12] and Zangibadi and Maleki [13]
Tables and
presented a
Figures
fuzzy goal programming approach to determine
Next
table 1 represents the quantity available
an optimal
these
factory
solution for the multi-objective transportation
(Plants) for a
problem etc.
In this paper we are changing the transportation month
problem in linear programming problem and
Table 1
solving this
problem by Dual Simplex Method, Phase Two
factory(Plant
Method,
s)
Supply
Bounded Simplex Method and Big M Method.
Madideep(
20
They all
A)
Truck
method are using to solve the linear
Gajiabad(B
50
programming
)
Truck
problems. In this paper we are use Tora Software
Calcutta(C
50
to solve
)
Truck
all these method.
Total
120

81

Sharma et. al/ Solving Transportation Problem with the various method of Linear
Programming Problem
Table 4
Next table 2 represents the total demand of
(X) (Y) (Z) Capacity
the warehouses in various places. These
(A)
8
10 20 0
20
supplies for a month
(B)
40
30
55
0
50
Table 2
(C)
20 25 35 0
50
Warehouse
s
Demand
Deman
Bhopal(X) 10
d
10 6
14 90
Raipur(Y)
06
Linear
Programming
Problem
Mumbai(Z) 14
Formulation of Transportation Problems
Total
30
Now we are converting the transportation
problem in Linear programming problem by
FORMULATION AND TABLES
using table 4
In
this
problem
we
make
a
transportation problem for Albert David
X11 + X12 + X13 20
(I)
Company as being the essential commodity.
Minimize:
Z=
We get the following transportation model to
8X11+10X12+20X13+40X21+30X22+55X23+
determine an optimal solution so as to
20X31+25X
minimize the transportation cost.
32+35X33
Table 3
Subject to constraint:
Capacit
X21 + X22+ X23 50 (II)
(X) (Y) (Z) y
X31 + X32 + X33 50(III)
(A)
8
10 20 20
X11 + X21 + X31 10(IV)
(B)
40 30 55 50
X12 + X22 + X32 6..(V)
(C)
20 25 35 50
X13 + X23+ X33 14 (VI)
Deman
X11, X12, X13, X21, X22, X23, X31, X32, X33 0
d
10 6
14
After Using Tora Software on Transportation
Here ai = 120, bj = 30. since ai bj, Problem and Linear Programming Formulation
we introduce the dummy warehouse D with of Transportation Problem we are getting the
the demand 90 trucks and zero transportation optimal solution of our transportation problem
cost, as shown in the next table in the form of which solving for Albert David Company to
reduce transportation cost presented in
balanced transportation problem:following table:
Table 5

Name of Methods

Occupied cell / Constraints

Optimal Solution

Vogel Approximation Method

Rs 5,40,000

Big-M Method

X11 = 0,
X24 =
50,
X31 =
10,

Two-Phase Method

S4 = 50,
X31 =
10,
S4 = 50,
X31 =
10,

X12 = 06, X13 = 14

X31 = 10, X34 = 40
X12 = 06, X13 = 14
X33 =
00 ,
S5 = 40
X12 =
06,
X13 = 14
X33 = 00
,
S5 = 40

Rs 5,40,000

Rs 5,40,000

X12 = 06, X13 = 14

Rs 5,40,000
X11 =
S1 = 50,
00
S2 = 40
Mathematics and Computation, Vol. 158,
CONCLUSION
( 2004), pp459-475
We have established the uniqueness 5. Seshan, C. R., Tikekar, V. G. On the
and existence of optimal solution of the
Sharma
Swaup
algorithm
for
time
transportation problem for Albert David
minimizing
transportation
problems,
Company. This has been brought out through
Proceeding of Indian Academy of Sciences
developed transportation problem into linear
Mathematical Science, Vol. 89, (1980), pp
programming problem and applying the
101-102
discuss methods in paper which yields the 6. Sharma, Gaurav; Abbas, S. H.; Gupta,
same four optimal solution as shown in table
VijayOptimum
5 and have stated the optimality conditions of
Solution of Transportation Problem with the
the problem. And we get all method give the
help of phase-II method of Simplex
same result but dual simplex method is best
Method, Indian journal of applied life
with respect to VAM because dual simplex
science, Vol. 6, No. 1 & 2, (2011), pp 49-54
have minimum no. of iterations.
7. Sharma, Gaurav; Abbas, S. H.; Gupta, Vijay
REFERENCES
Dual Simplex
Algorithm for Proctor & Gamble to Solve
1. Hitchcock, F. L. The distribution of product
from several source to numerous localities,
Transportation
J. Maths. Phy. ,vol
Problem, Journal of Ultra Scientist of
20, (1941), pp 224-230
Physical Sciences, vol. 23, No. 2, (2011)
2. Koopman, T.C. Optimum utilization of 8. Sharma, J.K., Swarup, K. "Time minimizing
transportation
system,
Proc.
Intern.
transportation problem", Proceedings of
Statics. Conf. Washington D.C.,
Indian Academy of Sciences-Mathematical
(1947)
Sciences, Vol. 86, ( 1977), pp513-518
3. Prakash, S. "On minimizing the duration of 9. Sonia, Khandelwal, A., Puri, M.C. "Bilevel
transportation", Proceedings of the Indian
time minimizing transportation problem",
Academy
of
Sciences-Mathematical
Discrete Optimization,Vol. 5, No.4, ( 2008),
Sciences, Vol. 91, ( 1982), pp53-57
pp714-723
4. Papamanthou, C., Paparrizos, K., Samaras 10. Sonia, Puri, M.C. "Two level hierarchical
N. "Computational experience with exterior
time minimizing transportation problem",
point algorithms for the transportation
Top, Vol. 12, No.2, ( 2004), pp301-330,
problem", Applied
Dual Simplex Method

82

Sharma et. al/ Solving Transportation Problem with the various method of Linear
Programming Problem
transportation problem, Omega, Vol. 34,
11. Surapati, P. and Roy, T. K. Multi-objective
(2006) pp
transportation
model
with
fuzzy
158-166
paparmeters: Priority based fuzzy goal 13. Zangibadi, M and Maleki, H. R. Fuzzy goal
programming approach, Journal of
programming for multi-objective transportation
Transportation Systems Engineering and
problem, Applied
Information Teachnology, Vol. 8, (2008) pp
Mathematics and Computation, Vol. 24,
40-48
(2007), pp 449-460.
12. Wahead, W. F. and Lee, S. M. Interactive
fuzzy goal programming problem for multiobjective

83