A Comparative Study Between New Proposed Technique (LPAM) and the Other Existing Techniques to Find IBFS for Transportation Problem
Abstract
A transportation model is a special case of a linear programming problem in which the main objective is to transport raw material, or finished products are transported from warehouses to factories or vice-versa, at a total minimum cost. Finding an initial basic feasible solution is the basic requirement to acquire an optimal solution for the transportation problems. In this study, a new technique named (LPAM- Technique) (The Largest penalty and allocate the maximum- technique) is proposed to locate the initial basic feasible solution for transportation problems. The performance of the LPAM is evaluated and compared with the existing techniques in the literature (NWCM, LCM, VAM, CVAM, iLCM). To clarify the statement, the applications are twenty randomly chosen and available in the literature to obtain the (IBFS) of the Transportation Problem. Obtained results show that by using this technique we found that the IBFS of most of the transportation problems is very close to the optimal solution or same as optimal solution than using the other existing techniques, which is discussed in this study, and it is observed that the performance of proposed technique is suitable for solving transportation problems.
Full text article
References
[1]-H. A. Taha, Operations Research: An Introduction, 8th Edition, Pearson Prentice Hall, Upper Saddle River, New Jersey 07458, (2007).
[2]-A. R. Khan, A. Vilcu, N. Sultana and S. S. Ahmed, Determination of Initial Basic Feasible Solution of a transportation Problem: A TOCM-SUM Approach, Buletinul Institutului Politehnic Din Iasi, Romania, Secţia Automatica si Calculatoare, Tomul LXI (LXV), 1, (2015), 39-49.
[3]-Md.S.Uddin, A.R.Khan, C.G.Kibria and I.Raeva, Improved Least Cost Method to Obtain a Better IBFS to the Transportation Problem, Journal of Applied Mathematics & Bioinformatics, 6(2) (2016) 1-20.
[4]-M.M.Ahmed, A.R.Khan, M.S.Uddin and F.Ahmed, Customized Vogel’s Approximation Method (CVAM) for solving transportation problems , Bul. Inst. Polit. Iaşi, Vol. 62 (66), No. 1-2, 2016.
[5]-Duraphe S. and Raigar S. (2017), “A new approach to solve transportation problems with the max-min total opportunity cost method”, International Journal of Mathematics Trends & Technology (IJMTT),Vol.51,No.4,2017, PP 271-275.
[6]-Azad S.M.Abool Kalaam, Hosain Md. Bellel, Md. M Raheman (2017),”An Algorithmic Approach to solve Transportation Problems with the Average TotalOpportunity cost method”,International Journal of Scientific & Research Publications,Vol.7,Issue 2,2017, PP 266-270.
[7]- Azad S. M. Abul Kalam, Hossain Md. Bellel (2017), “A New Method for Solving Transportation Problems Considering Average Penalty”, IOSRJournal of Mathematics (IOSR-JM),Vol.13,Issue 1, PP 40-43.
[8]-Swati V. Kamble, Bhausaheb G. Kore, A NewMethod to Obtain an Initial Basic Feasible Solution of Transportation Problem with the Average Opportunity Cost Method, International Journal of Engineering and Advanced Technology (IJEAT) , Volume 9, Issue 2 ,2019, PP 206-209
[9]-A. Mhlanga, I. S. Nduna, F. Matarise and A. Machisvo, Innovative Application of Dantzig’s North–West Corner Rule to Solve a Transportation Problem, International Journal of Educationand Research, 2(2), (2014), 1–12.
[10]-A. R. Khan, A Re-solution of the Transportation Problem: An Algorithmic Approach, Jahangirnagar University Journal of Science, 34(2), (2011), 49-62.
[11]-A. R. Khan, Analysis and Re-solution of the Transportation Problem: A Linear Programming Approach, M. Phil. Thesis, Department of Mathematics, Jahangirnagar University, Dhaka-1342, (2012).
[12]-N. M. Deshmukh, An Innovative Method for Solving Transportation Problem, International Journal of Physics and Mathematical Sciences, 2(3), (2012), 86–91.
[13]-E. J. Russell, Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem, Operations Research, 17(1), (1969), 187-191.
[14]-M. A. Babu, M. A. Helal, M. S. Hasanand U. K. Das, Lowest Allocation Method (LAM): A New Approach to Obtain Feasible Solution of Transportation Model, International Journal of Scientific and Engineering Research, 4(11), (2013), 1344-1348.
[15]-M. A. Babu, U. K. Das, A. R. Khan and M. S. Uddin, ASimple Experimental Analysis on Transportation Problem: A New Approach to Allocate Zero Supply or Demand for All Transportation Algorithm, International Journal of Engineering Research & Applications (IJERA), 4(1), (2014), 418-422.
[16]-M. M. Ahmed, A. S. M. Tanvir, S. Sultana, S. Mahmud and M. S. Uddin, An Effective Modification to Solve Transportation Problems: A Cost Minimization Approach, Annals of Pure and Applied Mathematics, 6(2), (2014), 199-206.
[17]-M. M. Ahmed, A. R. Khan, M. S. Uddin and F. Ahmed, A New Approach to Solve Transportation Problems, Open Journal of Optimization, 5(1), (2016), 22-30.
[18]-G. C. Ray and M. E. Hossain, Operation Research, First edition, Bangladesh, pp. 69, 237 (2007).
[19]-U. A. Wagener, A New Method of Solving the Transportation Problem,Operational Research Society, 16(4), (1965), 453–469.
[20]-U. K. Das, M. A. Babu, A. R. Khan, M. A. Helal and M. S. Uddin, Logical Development of Vogel’s Approximation Method (LD-VAM): An Approach to Find Basic Feasible Solution of Transportation Problem, International Journal of Scientific & Technology Research (IJSTR), 3(2), (2014), 42-48.
[21]-U. K. Das, M. A. Babu, A. R. Khan and M. S. Uddin, Advanced Vogel’s Approximation Method (AVAM): A New Approach to Determine Penalty Cost for Better Feasible Solution of Transportation Problem, International Journal of Engineering Research & Technology (IJERT), 3(1), (2014), 182-187.
Authors
Copyright (c) 2020 Journal of Pure & Applied Sciences

This work is licensed under a Creative Commons Attribution 4.0 International License.
In a brief statement, the rights relate to the publication and distribution of research published in the journal of the University of Sebha where authors who have published their articles in the journal of the university of Sebha should how they can use or distribute their articles. They reserve all their rights to the published works, such as (but not limited to) the following rights:
- Copyright and other property rights related to the article, such as patent rights.
- Research published in the journal of the University of Sebha and used in its future works, including lectures and books, the right to reproduce articles for their own purposes, and the right to self-archive their articles.
- The right to enter a separate article, or for a non-exclusive distribution of their article with an acknowledgment of its initial publication in the journal of Sebha University.
Privacy Statement The names and e-mail addresses entered on the Sabha University Journal site will be used for the aforementioned purposes only and for which they were used.