Applied Mathematical Sciences, Vol. 4, 2010, no.

72, 3603 - 3610

A New Approach for Solving Solid

Transportation Problems

P. Pandian and D. Anuradha

Department of Mathematics, School of Advanced Sciences
VIT University, Vellore-14, Tamilnadu, India
pandian61@rediffmail.com


Abstract

A new method using the principle of zero point method [10] is proposed for
finding an optimal solution of solid transportation problems. The proposed method
yields an optimal solution of the given solid transportation problem directly . It is
very easy to understand and apply which can serve managers by providing the
optimal solution to a variety of distribution problems involving three items. With
help of a numerical example, the proposed method is illustrated.

Mathematics Subject Classifications: 90C08, 90C90

Keywords: Solid transportation problem, Optimal solution


1 Introduction
The solid transportation problem (STP) may be considered as a special case
of linear programming problem. In STP, bounds are given on three items namely,
supply, demand and conveyance. In many industrial problems, a homogeneous
product is delivered from an origin to a destination by means of different modes of
transport called conveyances, such as trucks, cargo flights, goods trains, ships, etc.
The STP was proposed by Schell [12]. Haley [4] introduced the solution procedure
of STP which is an extension of the modified distribution method. For finding an
optimal solution, the STP requires 2 + + l n m nonzero values of the decision
variables to start with a basic feasible solution. Patel and Tripathy [11] developed a
computationally superior method for a STP with mixed constraints. Bit et al. [2]
developed the fuzzy programming model for a multi-objective STP. Vajda [13]
proposed an algorithm for a multi-index transportation problem which is an
extension of the modified distribution method. Basu et al. [1] provided an algorithm
3604 P. Pandian and D. Anuradha


for finding the optimum solution of a solid fixed charge linear transportation
problem. Gen et al. [3] gave a genetic algorithm for solving a bicriteria STP with
fuzzy numbers. Li et al. [8] designed a neural network approach for a multicriteria
STP. In [9], Li et al. improved the genetic algorithm given by [8] to solve the fuzzy
multiobjective STP with fuzzy numbers. J imenez and Verdegay [7] investigated
interval multi-objective STP via genetic algorithms. J imenez and Verdegay [5]
obtained a solution procedure for uncertain STP. In [6], J imenez and Verdegay
developed a parametric approach for solving fuzzy solid transportation problems by
an evolutionary algorithm. Pandian and Natarajan [10] have introduced the zero
point method for finding an optimal solution to a classical transportation problem.

In this paper, we propose a new method using the concept of zero point
method [10] for finding an optimal solution to a STP. In this method, we need not to
find an initial basic feasible solution to the given STP and dont use the MODI
method for testing optimality and improving the basic feasible solution to the STP,
but we obtain directly an optimal solution to the given STP. This method is very
easy to understand and apply which can serve managers by providing the optimal
solution to a variety of distribution problems involving three items. With help of a
numerical example, the proposed method is illustrated.


2 Preliminaries
Consider the following solid transportation problem (STP):

(P) Minimize z =
ijk ijk
l
k
n m
x c

= = = 1 1 j 1 i

subject to

i
1 1 j
a =

= =
ijk
l
k
n
x
, i =1, 2, , m (1)

j
1 1 i
b =

= =
ijk
l
k
m
x
, j =1, 2,, n (2)

k
1 1 i
e =
=

=
ijk
n
j
m
x
, k =1,2,,l (3)
0
ijk
x , for all i, j and k (4)
where
i
a is the amount of the material available at ith source ;
j
b is the amount of
the material required at jth destination ;
k
e is the amount of the material
transported by kth conveyance ;
ijk
c is the unit cost of transportation from the ith
source to jth destination by means of the kth conveyance and
ijk
x is the number
of units to be transported from ith source to jth destination by means of the kth
conveyance.
Solid transportation problems 3605


Any set of non-negative allocations to a STP which satisfies the equations
(1), (2), (3) and (4) is called a feasible solution of the STP.

A feasible solution of STP which minimizes the total shipping cost, that is,
ijk ijk
l
k
n m
x c

= = = 1 1 j 1 i
is called an optimal solution to the STP.

If =

=
i
m
i
a
1
=

=
i
n
j
b
1
k
l
k
e

=1
, the transportation problem is said to be
balanced. Otherwise, it is called unbalanced.

Result 1: The balanced condition is the necessary and sufficient condition for the
existence of a feasible solution to problem (P) [2].

Remark 1: If l =1, the number of conveyances is only one, the problem (P) reduces
to a classical transportation problem.


3 The proposed algorithm
Now, we propose a new method for finding an optimal solution to STPs.
First, we prove the following theorem which is going to be used in the proposed
method.
Theorem 1. If {
ijk
o
x , i =1,2,,m , j =1,2,,n, and k =1,2,,l } is an optimal
solution of the problem (Q)
(Q) Minimum
ijk k j i ijk
1 k 1 j 1 i
) ( x w v u c
l n m

=

=

subject to (1) to (4) and
0
k j i ijk
w v u c , for all i , j and k (5)
where
i
u ,
j
v and
k
w are any real values, then {
ijk
o
x , i =1,2,,m , j =1,2,,n,
and k =1,2,,l } is an optimum solution to the problem (P).
Proof. Clearly , {
ijk
o
x , i =1,2,,m , j =1,2,,n, and k =1,2,,l } is a feasible
solution of (P).
Suppose that {
ijk
o
x , i =1,2,,m , j =1,2,,n, and k =1,2,,l } is not an optimal
solution of (P).
Then, there exists a feasible solution {
ijk
y , i =1,2,,m, j =1,2,,n, and k =
1,2,,l } such that

3606 P. Pandian and D. Anuradha




<
=

=
ijk ijk
1 k 1 j 1 i
y c
l n m
ijk
ijk
1 k 1 j 1 i
o
x c
l n m

= = =
. (6)
Clearly, {
ijk
y , i =1,2,,m , j =1,2,,n, and k =1,2,,l } is also a feasible
solution of the problem (Q).
Now,
ijk k j i ijk
1 k 1 j 1 i
) ( y w v u c
l n m

=

=


ijk ijk
1 k 1 j 1 i
y c
l n m

=
=
ijk i
1 k 1 j 1 i
y u
l n m

ijk j
1 k 1 j 1 i
y v
l n m

ijk k
1 k 1 j 1 i
y w
l n m

ijk
ijk
1 k 1 j 1 i
o
x c
l n m
<
= = =
i i
1 i
a u
m

j j
1 j
b v
n

k k
1 k
e w
l

=
by (1) to (3)
=
ijk
k j i ijk
1 k 1 j 1 i
) (
o
x w v u c
l n m

= = =
by (1) to (3)
which contradicts{
o
ijk
x , i =1,2,,m, j =1,2,,n, and k =1,2,,l }is optimal
solution of (Q). Therefore,{
o
ijk
x , i =1,2,,m, j =1,2,,n and k =1,2,,l } is an
optimal solution of (P).
Hence theorem.


We, now introduce the proposed method for finding an optimal solution to a
STP.

The proposed method proceeds as follows.

Step 1: Check the given STP is balanced. If not, change into it.

Step 2: Construct O-D table in which rows are origins and columns are destinations.

Step 3: Subtract each entries of an origin of the table by its minimum and then,
subtract each entries of a demand of the reduced table by its minimum.

Step 4: Check if there is a possible to assign each supply with the corresponding
demands using the cells having zero cost. If so, go to Step 6. If not, go to the Step 5.


Solid transportation problems 3607


Step 5: Cover all origin(s), destination(s) and conveyance(s) having zeros of
reduced transportation table with the minimum number of horizontal and vertical
lines. Then, select a smallest uncovered element and subtract this minimum
element from all uncovered elements and add the same to all elements at the
intersection cells. Then, go to the Step 4.


Step 6: Construct the D-E table using the reduced table obtained from the Step 4.and
then, apply the Step 4. to the Step 5. to the D-E table. Then, go to the Step 7.


Step 7: Construct the E-O table using the reduced table obtained from the Step 6.
and then, apply the Step 4. to the Step 5. to the E-O table. Then, go to the Step 8.


Step 8: Check if there is a possible to assign each demand with the corresponding
supplies using the cells having zero cost and each supply with the corresponding
demands using the cells having zero cost , each demand with the corresponding
conveyances using the cells having zero cost and each conveyance with the
corresponding demands using the cells having zero and each supply with the
corresponding conveyances using the cells having zero cost and each conveyance
with the corresponding supplies using the cells having zero of the reduced solid
transportation table ( Such table is called allotment table). If not, convert into it by
applying the Step 5.


Step 9: Select an origin / a demand / a conveyance having minimum number of
zeros of the allotment table. Then, allot maximum possible to the zero cell having
minimum original cost. If more than one occurs, select any one.


Step 10: Reform the reduced table after removing fully used supply, fully received
demand and fully used conveyance or modifying not fully used supply, fully
received demand and fully used conveyance.


Step 11: Repeat the Step 9 and the Step 10 until all supplies are fully used, all
demands are fully received and all conveyances are fully used.


Step 12: This allotment yields an optimal solution to the given STP (by the Theorem
1.).


4 Numerical example

Now, we illustrate the proposed method by the following example.
3608 P. Pandian and D. Anuradha


Example 1: Consider the following solid transportation problem












Now, since =

=
i
m
i
a
1
=

=
i
n
j
b
1
k
l
k
e

=1
=34, the given STP is balanced.
Now, using the Step 2 to the Step 5, we have the following O-D table.











Now, using the Step 6, we obtain the following D-E table.








Now, using the Step 7, we obtain the following E-O table.









Capacity

Conveyance
E1 E1 E1 11
E2 E2 E2 14
E3 E3 E3 9
D1 D2 D3 Supply
O
1
4 7 8 3 9 7 6 7 2 11
O
2
4 2 6 1 3 8 8 4 5 13
O
3
8 1 3 4 7 3 5 6 4 10
Demand 7 15 12
D1 D2 D3 Supply
E1 E2 E3 E1 E2 E3 E1 E2 E3
O
1
2 7 6 1 9 5 4 7 0 11
O
2
3 3 5 0 4 7 7 5 4 13
O
3
5 0 0 1 6 0 2 5 1 10
Demand 7 15 12
E1 E2 E3 Demand
O1 O2 O3 O1 O2 O3 O1 O2 O3
D
1
7 7 9 8 3 0 11 9 4 7
D
2
2 0 1 6 0 2 6 7 0 15
D
3
4 6 1 3 0 0 0 3 0 12
Conveyance 11 14 9
O1 O2 O3 Conveyance
D1 D2 D3 D1 D2 D3 D1 D2 D3
E
1
7 2 4 7 0 6 9 1 1 11
E
2
8 6 3 3 0 0 0 2 0 14
E
3
11 6 0 9 7 3 4 0 0 9
Supply 11 13 10
Solid transportation problems 3609


Now, using the Step 8, we obtain the following allotment table:











Now, using the Step 9 to the Step 11, we obtain the following optimum allotment
table.











Therefore, the optimal solution to the given solid transportation problem is
, 2
121
= x , 9
133
= x , 9
221
= x , 4
222
= x , 7
312
= x 3
332
= x and the total
minimum transportation cost is 70.


5 Conclusion
The necessity of STP arises when heterogeneous conveyances are available
for shipment of products in public distribution system. The proposed method yields
an optimal solution of the given STP directly. In this method, we need not to find a
basic feasible solution with 2 + + l n m nonzero values of the decision variables
and dont use MODI method. This method can help decision makers in the logistics
related issues of real life problems by aiding them in the decision making process
and providing an optimal solution in a simple and effective manner.


References

[1] M. Basu, B.B.Pal and A. Kundu, An algorithm for finding the optimum
solution of solid fixed charge transportation problem, 31 (1994), 283-291.
Capacity

Conveyance
E1 E1 E1 11
E2 E2 E2 14
E3 E3 E3 9
D1 D2 D3 Supply
O
1
5 6 11 0 4 6 2 1 0 11
O
2
7 3 11 0 0 9 6 0 5 13
O
3
9 0 6 1 2 2 1 0 2 10
Demand 7 15 12
Capacity

Conveyance
E1 E1 E1 11
E2 E2 E2 14
E3 E3 E3 9
D1 D2 D3 Supply
O
1
5 6 11 0(2) 4 6 2 1 0(9) 11
O
2
7 3 11 0(9) 0(4) 9 6 0 5 13
O
3
9 0(7) 6 1 2 2 1 0(3) 2 10
Demand 7 15 12

3610 P. Pandian and D. Anuradha



[2] K. Bit, M.P. Biswal and S.S. Alam, Fuzzy programming approach to multi-
objective solid transportation problem, Fuzzy Sets and Systems, 57(1993),
183194.

[3] M. Gen, K. Ida, Y. Li, and E. Kubota, Solving bicriteria solid transportation
problem with fuzzy numbers by a genetic algorithm, Comput. Ind. Eng. ,
29 (1995), 537541.

[4] K.B. Haley, The solid transportation problem, Oper. Res., 11 (1962), 446448.

[5] F. J imenez and J .L. Verdegay, Uncertain solid transportation problems, Fuzzy
Sets and Systems, 100 (1998), 4557.

[6] F. J imenez and J .L. Verdegay, Solving fuzzy solid transportation problems by
an evolutionary algorithm based parametric approach, Eur. J . Oper. Res.,
117 (1999), 485510.

[7] F. J imencz and J .L. Verdegay, Interval multiobjective solid transportation
problem via genetic algorithms, Management of Uncertainty in Knowledge-
Based Systems, II (1996), 787792.

[8] Y. Li, K. Ida, M. Gen and R. Kobuchi, Neural network approach for
multicriteria solid transportation problem, Comput. Ind. Eng., 33(1997),
465468.

[9] Y. Li, K. Ida and M. Gen, Improved genetic algorithm for solving
multiobjective solid transportation problem with fuzzy numbers, Comput. Ind.
Eng., 33 (1997), 589592.

[10] P.Pandian and G. Natarajan, A new method for finding an optimal solution for
transportation problems, International J . of Math. Sci. and Engg. Appls. ,
4 (2010), 59-65.

[11] G. Patel and J .Tripathy, The solid transportation problem and its variants,
Intern. J . Management and Systems, 5 (1989), 17-36.

[12] E. Shell, Distribution of a product by several properties, Directorate of
Management Analysis, Proc. 2nd Symp. on Linear Programming, Vol. 2, 1955,
615-642, DCS/Comptroller H.Q.U.S.A.F., Washington, DC.

[13] S.Vajda, Readings in Linear Programming, Pitman, London, 1988.


Received: July, 2010