Available online at www.ijrp.

org

International Journal of Research Publications

Volume-40, Issue-1,November 2019

Accepted and Published Manuscript

Investigation of Basic Feasible Solution by Modified Algorithm

Arifuzzaman, Md.Rumman Rafi, Md. Salehin Ferdous, Ariful Islam, Maksuda Akter Sawpna

PII : Arifuzzaman.100401112019806
DOI: 100401112019806
Web: http://ijrp.org/paper-detail/807

To appear in: International Journal of Research Publication (IJRP.ORG)

Received date: 14 Nov 2019

Accepted date: 16 Nov 2019
Published date: 16 Nov 2019
Please cite this article as: Arifuzzaman, Md.Rumman Rafi, Md. Salehin Ferdous, Ariful Islam, Maksuda
Akter Sawpna , Investigation of Basic Feasible Solution by Modified Algorithm , International Journal of
Research Publication (Volume: 40, Issue: 1), http://ijrp.org/paper-detail/807

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our
customers we are providing this final version of the manuscript.

2019 Published by IJRP.ORG. Selection and/or peer-review under responsibility of International Journal of
Research Publications (IJRP.ORG)
 Arifuzzaman / International Journal of Research Publications (IJRP.ORG)

Available online at www.ijrp.org

International Journal of Research Publications

Investigation of Basic Feasible Solution by Modified

Algorithm
Arifuzzaman1, Md.Rumman Rafi2, Md. Salehin Ferdous2, Ariful Islam3,Maksuda Akter
Sawpna4
1
Department of Mathematics, Fareast International University, Dhaka -1213, Bangladesh
2
Department of Electrical & Electronic Engineering, Fareast International University, Dhaka -1213, Bangladesh
3
Department of Civil & Environmental Engineering, Fareast International University, Dhaka -1213, Bangladesh
4
Department of Mathematics, European University, Dhaka -1213, Bangladesh

Abstract

A significant undertaking in Operation Research (OR) is to locate the Basic Feasible Solution (BFS) of
Transportation Problem (TP). In this, the distribution indicators (DI) have been resolved from the distinction of the
biggest unit cost and average value of total unit cost of each row and column .The area of the fundamental cells
have been resolved as the biggest entrance of the transportation Table (TT) along the biggest DI. The modified
technique is delineated with a model alongside the optimality test to legitimize its proficiency. It is seen that the
strategy introduced in this is material similarly on the reasonable and lopsided TP with equivalent imperatives.

Keyword: BFS, TP, TT, biggest unit cost and average value of total unit cost etc

1. INTRODUCTION
Transportation model assumes an indispensable job to guarantee the productive development and in-time
accessibility of crude materials and completed merchandise from sources to goals. Transportation issue is a Linear
Programming Problem (LPP) originated from a system structure comprising of a limited number of hubs and
circular segments joined to them [2, 5, 8]. The goal of the TP is to decide the transportation plan that limits the all
out transportation cost while fulfilling the request and supply limit [1,9,14].In writing, a great number of looks into
[1, 3, 13, 6] are accessible to get the fundamental achievable answer for TP with equivalent imperatives. Here we
present the common issue of single item to be moved from m causes (production lines) to n goals (stockrooms/deals
focuses) wherein and are the limits of the sources and goals separately. There is a consistent called per unit moving
expense from the starting point to the goal .There is a variable speaking to the obscure amount to be moved from the
beginning to the goal. A few strategies are accessible to accomplish the objective. The outstanding techniques are:
Vogel's Approximation Method (VAM) [8, 11, 12], Balakrishnan's variant of VAM [4, 6, 9], Shore's use of VAM
[7, 10, 14], H.S. Kasana et. al's. Extreme Difference Method for Transportation [1, 3, 6] are useful for the essential
doable arrangement. In this paper, our modified technique which gives preferred BFS over given by the strategies
just referenced.

www.ijrp.org
 Arifuzzaman / International Journal of Research Publications (IJRP.ORG)

2. Algorithm of the Modified Method

Step 1: Put the row and the column allocation markers just after and underneath
the supply limits and request necessities respectively inside first
brackets.These are the distinction among the biggest unit cost and
average values of complete unit cost of each row and column of TT.In
the event that there are at least two biggest components in
succession/section, contrast must be taken as zero.
Step 2: Identify the largest distribution indicator and choose the smallest cost
element along the largest distribution indicator. If there is more than one
smallest element, choose any one of them arbitrarily.
Step 3: Allocate on the left-apex of the best unit cost in
the cell of the TT where is the sum to be delivered by the ith
factories of jth items; and are the manufacture capacity and
demand requirement of the i factories and jth manufacture respectively
th

Step 4: If a i  b j , leave the i-th row and re-adjust b j as b /j  b j  ai .

If a i  b j , leave the j-th column and re-adjust a i as ai/  ai  b j .
If a i  b j , then leave either i-th row or j-th column but not
both.

Step 5: Repeat Step1 to 4 until the demand and supply are exhausted.

m n
Step 6: z c ij xij , c ij being the cost elements of the TT where
i 1 j 1

, c ij is the cost unit of ith row and jth column of the TT.

3. Example
An organization fabricates concretes and it has three factories F1, F2and F3 in three unique areas, whose weekly
generation limits are 30, 50 and 20 measurement tones separately. The organization supplies concretes to its four
distribution centres situated at D1, D2 ,D3 and D4 whose week after week requests are 20, 40, 30 and 10 measurement
tones individually. The transportation costs per metric tone of concretes (in thousand dollars) from various
processing plants to stock rooms are given beneath in the TT:

Factories Showrooms Supply

1 2 1 4 30
3 3 2 1 50
4 2 5 8 20

Demand 20 40 30 10 100

www.ijrp.org
 Arifuzzaman / International Journal of Research Publications (IJRP.ORG)

The distribution made by the distinction among the biggest unit cost and average value of total unit cost is

Factories Warehouse Capacity

of
𝑃1 𝑃2 𝑃3 𝑃4 Supply Row distribution indicator
𝐹1 201 2 101 4 30 1 1 1
𝐹2 3 203 202 101 50 0 0 0 0 0 0

𝐹3 4 202 5 8 20 5 0

Demand 20 40 30 10 100

1 0 2 5
distribution indicator

0 0 1
Column

0 1 1
0 1 2
0 1
0
.

The number of basic variables is 6(= 4+3-1) and the basic cells do not contain a loop. Thus the solution obtained in
this modified method is a basic feasible solution.
 The initial basic feasible solution is
Therefore, the minimum transportation cost is
Z = 1*20 + 1*10 +3*20 + 2*20 + 1*10 + 2*20
= $180 thousand
3.1 Test for optimality
Evaluation for basic cells:

And we get, =0, , , , ,

3.2 Evaluation for non-basic cells:
12  u1  v2  c12  1  3  2  0
14  u1  v4  c14  1  1  4  4
 21  u2  v1  c21  0  2  3  1
 31  u3  v1  c31  1  2  4  3
 33  u3  v3  c33  1  2  5  4
 34  u3  v4  c34  1  1  8  8

www.ijrp.org
 Arifuzzaman / International Journal of Research Publications (IJRP.ORG)

We see that all  ij (for i=1, 2, 3 and j=1, 2, 3,4) are negative. Therefore, the initial basic feasible solution found in
our method is optimal.
We may conclude that the optimal transportation cost is 180 thousand dollars.
4. Comparison of transportation cost obtained in different methods

Method Transportation Cost

(in thousand dollars)
Modified Method 180
VAM 180
Column Minima 180
Matrix Minima 180
Row Minima 180

5. CONCLUSION
The displayed technique gets an essential possible arrangement of transportation issue with equivalent
imperatives. The modified technique can be utilized to take care of a wide range of transportation issue.
As a rule it gives better fundamental practical arrangement comparative with the other existing
techniques. All the time this technique gives the ideal arrangement legitimately.

References:

[1] Adlakha, V. and K. Kowalski, A Simple heuristic for solving Small Fixed Charge
Transportation Problems,Omega,Vol.31,No.3,pp.205-211,2003.
[2] Ahuja, K.K., Production Management, CBS Publishers and Distributors, New
Delhi, India ,2007
[3] Balakrishnan, N., Modified Vogel’s Approximation Method for Unbalance
Transportation problem, Applied Mathematics Letters, Vol.3, No.2,pp.9-11,1990.
[4] Gupta, p.k. and D.S. Hira, Operations Research, S. Chand and Company Ltd. New
Delhi,2009.
[5] Kapoor, V.K., Operations Research, Sultan Chand and Sons, New Delhi,2002.
[6] Kasana, H.S. and k.D. kumar, Introductory Operations Research:Theory and
Applications, springer international Publications,pp.509-511,2004.
[7] Korukoglu, S and S. Balli, An Improved Vogel’s Approximation Method for the
Transportation Problem, Association for Scientific Research, Mathematical and
Computational Application Vol.16 No.2, 370-381,2011.
[8] Pandian, p. and G. Nataraj, A New Approach for solving Transportation Problems
with Mixed constraints, Journal of physical Sciences,Vol.14,pp.53-61,2010.
[9] Ravindran, a., Don T. Phillips james j. Solberg, Operation Research: Principles and
Practice , John wiley and sons, New York.
[10] Swarup, k., p.k. Gupta and Man Mohan, Operation Research, Fourteenth Edition, S.
Chand and Sons, New Delhi.
[11] Taha, H.A, Operation Research ,An Introduction ,Sixth Edition, Prentice –Hall of
India Private Ltd.
[12] www.easycalculation.com/operation-research.
[13] Anderson, Sweeney and Williams. An Introduction to management Science
quantitative Approaches to decision making.Chp-7,pp 296 315.
[14] Dr. Ganesh Chandra ray, Operation Research, Transportation and Assignment
Problem, PP 56-80.

www.ijrp.org