J. Comp.Matha. Vol.

3(1), (2019), ISSN: 2456–8686

Original Research Article

Journal of Computational Mathematica
Journal homepage: www.shcpub.edu.in
ISSN: 2456-8686
SACRED HEART RESEARCH PUBLICATIONS

An Optimal Solution for Transportation problem-DFSD

1 2 3 4
J. Ravi, S. Dickson, R. Akila and K. Sathya
Received on 31 December 2018, Accepted on 2 February 2019

Abstract. The new approach proposed in this paper namely DFSD (Difference
form Standard Deviation) method is applied for finding the optimal solution for
transportation problem. The proposed algorithm is unique way to reach feasible
and optimal solution without or with degeneracy condition. It is directly find the
optimal solution with minimum number of iterations compared to other existing
method.
Key words: DFSD, NWCR, LCM,VAM, MODI and optimal solution.

1. Introduction

The transportation model was first presented by FL Hitchcock in 1941. It

was further developed by TC Koopmans (1949) and GB Dantzing (1951) towards
the formulation and solution of linear programming problem. It is why the
transportation model is regarded as a specific type of linear programming
problem which analyse the transportation of certain homogeneous goods or
services from their different sources of origins to their different destination of
requirements.
Kirca and Stir [1] was constitutes an important of transportation problem
and developed a heuristic, called part of logistics management. In addition,
logistics TOM (Total Opportunity-cost Method), Gass [2] the practical issues for
the decision problem of minimizing dead kilometers solving transportation
problems. The comments on various aspects of transportation problem is
1Corresponding Author: E-mail: [email protected], 2
[email protected],
3
[email protected]
1,2,3,4
Department of Mathematics, Vivekanandha College for Women, Tiruchengode,
Namakkal, Tamilnadu, India.
43
 J.Comp.Matha. Vol.03(01),(2019), 43-51 J. Ravi et al. 44
important in urban transport undertakings, methodologies along with discussions
on the as dead kilometres mean additional losses.
Many of them define transportation problem procedure in various
aspects [3]- [7]. In this paper consisting introduction in section 1 and followed
section 2 containing the basic need of existing methods. Section 3 discussed in
proposed new algorithm and experimental result is confirmed in section 4.
Finally conclusions arise in our point of view based on proposed method.

2. Basic concept of Existing Methods

According to transportation problem, we are focusing on the original points.

These points may represent factories to produce items, and to supply a required
quantity of the products to a certain number of destinations. This process must
be done successfully in such a way as to maximize the profit or minimize the cost
transportation. Therefore, the places of production and supply are collected as
the original points and the destinations respectively.
Sometimes the original and destinations points are also termed as sources
and sinks. However, to illustrate a typical transportation model, suppose that
m factories supply certain items to n warehouses. As well as, let factory i (i =
1, 2, · · · , m) produces ai units, and the warehouse j (j = 1, 2, · · · , n) requires bj
units. Furthermore, suppose the cost of transportation from factory i to warehouse
j is cij . The decision variables xij is being the transported amount from the factory
i to the warehouse j. Typically, our objective is to find the transportation pattern
that will minimize the total of the transportation cost.

Table 1. The model of a transportation problem

Origins(Factories) Destinations(Warehouses) Available

1,2,· · · ,n
1
c11 c12 c1n a1
2 c21 c22 c2n a2
··· ··· ··· ···
m cm 1 cm2 cmn am
Required b1 b2 b3
 An Optimal Solution for Transportation problem-DFSD 45

There are several algorithms for solving transportation problems which are
based on different of special linear programming methods, among these are:
1. Northwest Corner Method (NWCM), 2. Minimum Cost Method (MCM), 3.
Genetic algorithm, 4. Vogel’s approximation Method (VAM), 5. Row Minimum
Method, 6. Column Minimum Method and etc.,

3. Hybrid proposed DFSD method

In this study, we proposed a new solving method for transportation problems

by using DFSD. The proposed method must operate the as following:

3.1. Method of DFSD

Find the difference from standard deviation method (DFSD). The difference is
standardized based on the normal distribution. Usually Vogel’s Approximation
Method (VAM) to chosen the maximum number is different type of difference
values in cost matrix. All the methods are finding Initial Basic Feasible Solution
(IBFS) and Optimal Solution (OS). In our proposed method to modified this step
only. Difference is not give actual difference values so we are standardized that
difference so it is bring exact differences.
v"
u  P   P 2 #
u x2 x2
σ = S.D = t − (1)
n n

where, n is the number of values and x is the corresponding row/column values.

Algorithm: DFSD
Step1: The result of DFSD method (from equation 1) the smallest unit
cost element in the row/column (cell) from the immediate next smallest unit cost
element in the same row/column is determining a penalty measure for the target
row/column.
i). This step includes the following sub-steps:

a. Identify the row or the column that includes the largest penalty.
b. Break ties arbitrarily.
 J.Comp.Matha. Vol.03(01),(2019), 43-51 J. Ravi et al. 46

c. As much as possible, the lowest cost row/column (cell) in the row or column
should be allocated with the highest difference.
d. Adjust the supply and demand, and then cross out the satisfied row or
column.
e. If a row and column are satisfied simultaneously, then only one of them is
crossed out, as well the remains rows or columns are assigned to supply as
zero (demand).
ii). finally, the result should be computed as follows:
a. If a row or a column is assigned as zero supply, or demand remains
uncrossed out, then stop the process.
b. If one row/column with positive supply (demand) remains uncrossed out,
then determine the basic variables in the row/column by the lowest cost
method, and then stop.
c. If all the uncrossed out rows and columns have (remaining) zero supply and
demand then determine the zero basic variables by the lowest cost method
and stop.
d. Otherwise, go to step (1).

4. Experimental Study

Problem 1: In this problem is balanced one. We applying the most familiar

methods of NWCM, LCM and VAM compared to our proposed DFSD method.
Finding the Optimal solution for the given T.P.

Origin/Destination D1 D2 D3 D4 Supply
O1 4 7 8 3 10
O2 2 1 10 12 15
O3 7 8 3 4 10
Demand 7 10 6 12 35
 An Optimal Solution for Transportation problem-DFSD 47

(i) NWCR

Origin/Destination D1 D2 D3 D4 Supply
4 7 8 3
O1 10
(7) (3)
2 1 10 12
O2 15
(7) (8) (2)
7 8 3 4
O3 10
(10)
Demand 7 10 6 12 35

The initial basic feasible solution is,

(7 × 4) + (7 × 3) + (7 × 1) + (6 × 10) + (12 × 2) + (10 × 4) = Rs. 180/−
After applying modified Distribution method the problem gives the optimal
transportation cost is Rs.86/-.

(ii) LCM

Origin/Destination D1 D2 D3 D4 Supply
4 7 8 3
O1 10
(10)

2 1 10 12
O2 15
(5) (10)

7 8 3 4
O3 10
(2) (6) (2)

Demand 7 10 6 12 35

The Initial basic feasible solution is,

(3 × 10) + (2 × 5) + (1 × 10) + (7 × 2) + (3 × 6) + (4 × 2) = Rs. 90/−
After applying modified Distribution method the problem gives the optimal
transportation cost is Rs.86/-
 J.Comp.Matha. Vol.03(01),(2019), 43-51 J. Ravi et al. 48

(iii) VAM

Origin/Destination D1 D2 D3 D4 Supply
4 7 8 3
O1 10
(10)

2 1 10 12
O2 15
(5) (10)
7 8 3 4
O3 10
(2) (6) (2)
Demand 7 10 6 12 35

The Initial basic feasible solution is,

(3 × 10) + (2 × 5) + (1 × 10) + (7 × 2) + (3 × 6) + (4 × 2) = Rs. 90/−

After applying modified Distribution method the problem gives the optimal
transportation cost is Rs. 86/-

(iv) DFSD

Step: 1

Origin/Destination D1 D2 D3 D4 Supply SD1

4 7 8 3
O1 10 2.06

2 1 10 12
O2 15 4.8←
10

7 8 3 4
O3 10 2.06

Demand 7 10 6 12 35
SD1 2.05 3.85 3.09 1.46
 An Optimal Solution for Transportation problem-DFSD 49

Step: 2

Origin/Destination D1 D3 D4 Supply SD2

4 8 3
O1 10 2.16

2 10 12
O2 5 4.3←
5
7 3 4
O3 10 2.6

Demand 7 6 12 35
SD2 2.05 3.09 1.46

Step: 3

Origin/Destination D1 D3 D4 Supply SD3

4 8 3
O1 10 2.16

7 3 4
O3 10 2.6←
6
Demand 7 6 12 35
SD3 1.5 2.5 0.5

It follow the same procedure to get the final cost matrix is

Origin/Destination D1 D2 D3 D4 Supply
4 7 8 3
O1 10
(2) (8)
2 1 10 12
O2 15
(5) (10)
7 8 3 4
O3 10
(6) (2)
Demand 7 10 6 12 35
 J.Comp.Matha. Vol.03(01),(2019), 43-51 J. Ravi et al. 50

The Initial basic feasible solution is,

(3 x8)+(2x5)+(1x10)+(4x2)+(3x6)+(4x2) = Rs. 86/-
After applying modified Distribution method the problem gives the optimal
transportation cost is Rs.86/-

Table 2. IBFS and OS is obtained in different types of problems

Methods
Types of NWCR LCM VAM DFSD
Problems
IBFS OS IBFS OS IBFS OS IBFS OS
Balanced 180 86 90 86 90 86 86 86
No.of iteration - 3 - 2 - 1 - 0
Unbalanced 246 184 190 184 186 184 184 184
No.of iteration - 3 - 2 - 1 - 0
Non - Degeneracy 1256 980 1080 980 1010 980 980 980
No.of iteration - 3 - 3 - 1 - 0
Degeneracy 456 210 421 210 245 245 210 210
No.of iteration - 2 - 2 - 1 - 0

The above table indicate that the different types of problems solved and noted
IBFS and OS. Compare to other existing method our proposed method directly
give the OS. So, no need to go IBFS and our proposed method gave minimum
number of iteration to get the OS.

5. Conclusion

In this paper we are proposed new hybrid T.P by using DFSD method. The
above table indicate that the different types of problems solved and noted IBFS
and OS. The example 1 is the gives the model problem and how to solve the DFSD
method. Compare to other existing method our proposed method directly gave
the OS. So, no need to go apply optimal solution (like MODI method) and our
 An Optimal Solution for Transportation problem-DFSD 51

proposed method gave minimum number of iteration. Our proposed method is

quite easy and minimizing valuable time. It is only applying the existing methods
the complicated problem to give minimum number of iteration to get OS compared
to other methods

References

[1] Kirca, O. and A. Satir, 1990. A heuristic for obtaining an initial solution for the
transportation problem. Journal of Operational Research Society, 41(9): 865-871.
[2] Raghavendra, B.G. and M. Mathirajan, 1987. Optimal allocation of buses to depots - a case
study. Opsearch, 24(4): 228-239.
[3] S.Aramuthakannan at el, Revised Distribution Method of finding Optimal Solution for
Transportation Problems, IOSR Journal of Mathematics, 4 (5), 2013, 39-42.
[4] S.Aramuthakannan at el , Application of Revised Distribution Method for Finding Optimal
Solution of Unbalanced Transportation Problems, Indian Journal of Research, 5 (1), 2016,
32-34.
[5] Mrs. Rekha Vivek Joshi, Optimization Techniques for Transportation Problem of Three
Variables, IOSR Journal of Mathematics, vol 9, issue 1, 2013, pp 46-50.
[6] Anshuman Sahu, Rudrajit Tapador, Solving the assignment problem using genetic algorithm
and simulated annealing, IJAM, (2007).
[7] Hadi Basirzadeh . Ones Assignment Method for Solving Assignment Problems ,Applied
Mathematical Sciences, 6 (47), 2345 2355, 2012.
[8] Prem Kumar Gupta, D.S.Hira, Operations Research, Edition2007.
[9] J.K Sharma, Operation Research Theory and Applications, 5th Edition, 2013.

www.shcpub.edu.in