Authors:
Sanaullah Jamali,Abdul Sattar Soomro,Muhammad Mujtaba Shaikh,DOI NO:
https://doi.org/10.26782/jmcms.2020.10.00007Keywords:
Transportation problem,initial basic feasible solution,Optimal solution,North-west-corner,Least cost,Vogel’s approximation,Revised distribution,Modified distribution,Abstract
It is one of the most important tasks to determine the optimal solution for large scale transportation problems in Operations research more efficiently, accurately and quickly. In this research, we develop a new and efficient initial basic feasible solution (IBFS) method for solving balanced and unbalanced transportation problems so that the cost associated with transporting a certain amount of products from sources to destinations is minimized while also satisfying constraints. The proposed method – the minimum demand method (MDM) – to find a starting (initial) solution for the transportation problems has been developed by taking minimum value in demand row, and in case of a tie the demand with the least cost in the corresponding column is selected. The performance evaluation of the proposed MDM is carried out with other benchmark methods in the literature, like the north-west-corner method (NWCM), least cost method (LCM), Vogel’s approximation method (VAM) and revised distribution (RDI) method. The IBFSs obtained by the proposed MDM and existing NWCM, LCM, VAM and RDI have been compared against the optimal solutions acquired through the modified distribution (MODI) method on 12 balanced and unbalanced problems from literature, and the relative error distributions are presented for accuracy. The results obtained by the proposed MDM are better than NWCM, LCM, VAM and RDI. The proposed MDM gives initial basic feasible solutions that are the same as or very closer to the optimum solutions in all cases we have discussed. The comparison reveals that the proposed MDM reduces the number of tables and the number of iterations to reach at more accurate and reliable IBFS. The MDM will also save the total time period of performing tasks and reduce the number of steps in order to get the optimal solution.Refference:
I. Abdallah A. Hlayel & Mohammad A. Alia (2012), Computer Science & Engineering: An International Journal (CSEIJ), Vol.2, No.5, October 2012.
II. Abdul Quddoos, Shakeel Javaid and M. M. Khalid (2012) International Journal on Computer Science and Engineering (IJCSE), ISSN: 0975-3397 Vol. 4 No. 07.
III. Aramuthakannan.S & Dr.P. R Kandasamy (2013). IOSR Journal of Mathematics (IOSR-JM), ISSN: 2278-5728. Volume 4, Issue 5 (Jan. – Feb. 2013), PP 39-42.
IV. Bhan, V., Hashmani, A. A., & Shaikh, M. M. (2019). A new computing perturb-and-observe-type algorithm for MPPT in solar photovoltaic systems and evaluation of its performance against other variants by experimental validation. Scientia Iranica, 26(Special Issue on machine learning, data analytics, and advanced optimization techniques in modern power systems [Transactions on Computer Science & Engineering and Electrical Engineering (D)]), 3656-3671.
V. Charnes, A., and W. W. Cooper (1961), Management Models and Industrial Applications of Linear Programming (John Wiley and Sons, Inc., New York.
VI. George B. Dantzig, 1963, Linear Programming and Extentions, Princeton University Press, Princeton, N J.
VII. Hitchcock, Frank L. (1941) ‘The distribution of a Product from Several Sources to Numerous Localities’, J. Math. Phys. pp. 224-230.
VIII. Ijiri, Y. (1965), Ma11agement Goals and Accounting for Control, North Holland, Amsterdam.
IX. Jamali, S., Shaikh, M. M., & Soomro, A. S. (2019). Overview of Optimality of New Direct Optimal Methods for the Transportation Problems. Asian Research Journal of Mathematics, 15(4), 1-10.
X. Kantorovich, L. 1942: On the translocation of masses. C.R. (Doklady) Acad. Sci. URSS (N.S.) 37, 199–201.
XI. Khoso, A. H., Shaikh, M. M., & Hashmani, A. A. (2020). A New and Efficient Nonlinear Solver for Load Flow Problems. Engineering, Technology & Applied Science Research, 10(3), 5851-5856.
XII. Koopmans, (1947) ‘Optimum Utilization of the Transportation System’, Econometrica, Vol XVII.
XIII. Kwak N.K. & Schniederjans, M.J. (1985). Goal programming solutions to transportation problems with variable supply and demand requirements. Socio-Economic Planning Science, 19(2), 95-100.
XIV. Lawrence (1982) Seaway Development Corporation. The St. Lawrence Seaway Traffic Report for the 1981 Navigation Season, U.S. Dept. of Transportation.
XV. Lee & Moore. (1972), Goal Programmingfor Decision Analysis, Auerbach, Philadelphia.
XVI. Massan, Shafiq-ur-Rehman, Wagan, A. I., & Shaikh, M. M. (2020). A new metaheuristic optimization algorithm inspired by human dynasties with an application to the wind turbine micrositing problem. Applied Soft Computing, 90, 106176.
XVII. Mohammad Kamrul Hasan (2012), International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 1, Issue 2 (October 2012), PP.46-52.
XVIII. Monge, G. (1781) M´emoire sur la th´eorie des d´eblais et de remblais. Histoire de l’Acad´emie Royale des Sciences de Paris, avec les M´emoires de Math´ematique et de Physique pour la mˆeme ann´ee, pages 666–704.
XIX. M. Wali Ullah, Rizwana Kawser, M. Alhaz Uddin, “A DIRECT ANALYTICAL METHOD FOR FINDING AN OPTIMAL SOLUTION FOR TRANSPORTATION PROBLEMS”, J.Mech.Cont.& Math. Sci., Vol.-9, No.-2, January (2015) Pages 1311-1320.
XX. M. A. Hossen, Farjana Binte Noor, “Transportation Cost Effective named Maximum Cost, Corresponding Row and Column minima (MCRCM) Algorithm for Transportation Problem,” J. Mech. Cont. & Math. Sci., Vol.-14, No.-1, January-February (2019) pp 241-249
XXI. Pandian (2010), A New Method for Finding an Optimal Solution for Transportation Problems, International J. of Math. Sci. & Engg. Appls., vol 4, pp. 59-65.
XXII. Sharma R.S. (1999), N. Panigrahi, and S.M. Kaul. Aedes aegypti prevalence in hospitals and schools, the priority sites for DHF transmission in Delhi. Dengue Bull. 23: 109-112.
XXIII. Shetty, C.M. (1959). A Solution to the Transportation Problem with Nonlinear Costs,” Operation Research. Vol. 7. No. 5.
XXIV. Soland R.M. (1971), “An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints”, Manag. Sci., 17,759-773.
XXV. Soomro, A. S., Jamali, S., & Shaikh, M. M. (2017). On Non-Optimality of Direct Exponential Approach Method for Solution of Transportation Problems. Sindh University Research Journal-SURJ (Science Series), 49(1).
XXVI. Soomro, A. S., Junaid, M., & Tularam, G. A. (2015). Modified Vogel’s approximation method for solving transportation problems. Mathematical Theory and Modeling, 5(4).
XXVII. Soomro, Abdul Sattar, Gurudeo Anand Tularam & Ghulam Murtaza Bhayo (2014), A comparative study of Initial basic feasible solution method for transportation problems, Mathematical Theory and Modeling ISSN 2225-0522 (Online) Vol.4, No.1.pp.1-8.
XXVIII. Sudhakar, (2012) A New approach for finding an Optimal Solution for Transportation Problems, European Journal of Scientific Research, vol 68, pp. 254-257.
XXIX. Taha, H. A. (2011). Operations research: an introduction (Vol. 790). Upper Saddle River, NJ, USA: Pearson/Prentice Hall.