New Optimal AH Method for Solving Transportation Problems
DOI:
https://doi.org/10.47941/ijscl.2638Keywords:
Transportation problems, Initial Basic Feasible Solution (IBFS) methods, MODI and Stepping Stone methods, New AH optimal Method, Cost comparison and verification.Abstract
The main purpose of the paper is to develop a direct, new optimal method to minimize the total transportation cost from origin to destination by meeting supply and demand limits. Hundreds of transportation problems from different research papers have been solved by a new proposed optimal method. Its results are compared with the well-known and established techniques, especially the Steeping Stone method (1954) and the Modified distribution (MODI) method (1989), and it is found that all results obtained by the proposed method are optimal. In this paper, we have proposed a new optimal method, called the AH method for solving transportation problems. In the proposed method, there is no need to find an initial basic feasible solution (IBFS) because this is a direct method to find the optimal solution. Whenever the Steeping Stone method and the MODI method depend upon an initial feasible solution because both are not direct methods. A software package based on Java script programming designed by Html, CSS and Bootstrap was developed for new optimal AH method. Hundreds of balanced and unbalanced problems of different sizes solved from different research papers by using the software that provided optimal results.
Downloads
References
Abdelati, M.H. (2024). A New Approach for Finding an Initial Basic Feasible Solution to a Transportation Problem, Journal of Advanced Engineering Trends. Volume 43(1)
Arsham, H. (1989). A simplified MODI method for solving transportation problems European Journal of Operational Research. 43(2). pp 160-164
Azad, SMAK; Hossain, B. & Rehman, Md. M. (2017). An algorithmic approach to solve transportation problems with the average total opportunity cost method, Int. J. Scientific Res. Pub. 7(2). pp 1-3
Baloch, N; Shaikh, A.A; Shaikh, W.A Qureshi, S. (2022). Balanced TP with an Alternative Methodology for the Allocation Table Method, Journal of Statistics, Computing and Interdisciplinary Research. 4(1). pp 99-111
Charnes, A; Cooper, W.W. & Henderson, A. (1953). An Introduction to Linear Programming. John Wiley & Sons, New York.
Charnes, A. & Cooper, W.W. (1954). The stepping-stone method of explaining linear programming calculations in transportation problems Management Science. 1(1). pp 49-69
Dantzig, G.B. (1963). Linear programming & extensions. Princeton U. Press, Princeton, N.J
Dhurai, K. & Karpagam, A. (2017). To Obtain Initial Basic Feasible Solution Physical Distribution Problems Global Journal of Pure and Applied Mathematics. 13(9). pp 4671-4676
Gleyzal, A. (1955). An algorithm for solving the transportation problem Journal of Research National Bureau of Standards. (54). pp 213-216
Hitchcock, F.L. (1941). The Distribution of a Product from Several Sources to Numerous Localities Journal of Mathematics and Physics. 20. pp 224-230. https://doi.org/10.1002/sapm1941201224
Hossain, M.M; Islam, M.D. & Mamun, A.A. (2024). Lowest Supply and Demand Method to Find Basic Feasible Solution of Transportation Problems International Journal of Computer Applications. Volume 186(20). pp 0975-8887
Hussein, H.A & Shikar, M.A.K. (2020). A Modification to Vogel’s Approximation Method Journal of Physics: Conference Series. 1591
Islam, M.D.A; Haque, M.D.M. & Sharif Uddin, M.d. (2012). Extremum Difference Formula on Total Opportunity Cost: A Transportation Cost Minimization Technique Prime University Journal. 6(2). pp 125-130
Jamali, A.R.M.U; Janat, F. & Akhtar, P. (2017). Weighted cost opportunity-based algorithm for IBFS: A new approach in TP J. Engineering science. 08(1). pp 63-70
Jude, O; Ifeanyichukwu, O.B; Ihuoma, I.A. & Akpos, E.P. (2017). A new and efficient proposed approach to find initial basic feasible solution of a transportation problem. America journal of applied mathematics and statistics. 5(2). pp 54-61
Kavitha, M; Srinivasan, N. & Seethalakahmy, A. (2018). A new approach to solve initial basic feasible solution for the transportation problem. Int. J. Engineering and management research. 8(3). pp 46-48
Korukoglu, S. & Balli, S. (2011). An improved Vogel’s approximation method for the Computational Applications. 16(2). pp 370-381
Kumar, R; Gupta, R. & Karthiyayini, O. (2018). A new approach to find the initial basic feasible solution of a transportation problem. Int. J. Research Granthaalayah. 6(5). pp 321-325
Malviya, P. & Jain, S. (2018). Modified form of average transportation cost method (ATCM)- an efficient method for finding an initial basic feasible solution for transportation problem. Int. J. Mathematics trends and technology (IJMTT). 59(1). pp 1-3
Mohanta, S.K. (2019). An optimal solution for transportation problem: direct approach. J. Science. 34. pp 49-62
Patro, S.K. (2023). An efficient method to obtain IBFS of a TP. International Journal for Multidisciplinary Research. 5(4)
Quddoos, A; Javaid, S. & Khalid, M.M (2016). A revised version of asm-method for solving TP. Int. J. Agriculture statistical science. 2(1). pp 267-272
Reinfeld, N.V. & Vogel, W.R. (1958). Mathematical Programming. Englewood Cliffs. NJ: Prentice-Hall
Sharif-uddin, M.D; Khan, A.R; Kibria, C.G. & Raeva, I. (2016). Improved least cost method to obtain a better IBFS to the TP. J. Applied mathematics & bioinformatics. 6(2). pp 1-20
Shenofer, A.H. (2017). An alternate method to matrix minima method of solving transportation problem. Int. J. Pure and applied mathematics. 117(21). pp 489-495
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Huzoor Bux Kalhoro, Prof. Dr. Abdul Sattar Soomro, Dr. Reem Mahmoud Ahmed, Kashif Shaikh

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution (CC-BY) 4.0 License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.