Transportation Cost Effective named Maximum Cost, Corresponding Row and Column minima (MCRCM) Algorithm for Transportation Problem

admin February 23, 2019

Authors:

M. A. Hossen,Farjana Binte Noor,

DOI NO:

https://doi.org/10.26782/jmcms.2019.02.00016

Keywords:

Transportation Cost, Least Cost Method, Supply,Demand, Initial Basic feasible Solution,Optimum solution,

Abstract

Transportation model provides a powerful framework to meet the Business challenges. In highly competitive market the pressure is increasing rapidly to the organizations to determine the better ways to deliver goods to the customers with minimum transportation cost. In this paper we proposed a new algorithm based on Least Cost Method(LCM)for finding Initial Basic Feasible Solution(IBFS) to minimize transportation cost .Our proposed algorithm provides a IBFS which is either optimal or near to the optimal value with minimum steps comparatively better than those obtain by traditional algorithm or method .For the validity of this algorithm we considered a numerical transportation problem and comparative study has been made minimum cost with graphically.

Refference:

I.Ahuja, R.K.(1986). Algorithms for minimax transportation problem. Naval Research Logistics Quarterly.33 (4), 725-739. II.A.Gupta, S.Khanna and M. Puri, (1992), Paradoxical situations in transportation problems, Cahiers du Centre d’Etudes de RechercheOperationnell, 37–49.

III.Charnes, A. and Cooper, W. W. (1961). Management Models and Industrial Applications of Linear Programming, 1, John Wiley & Sons, New York.

IV.Erlander S.B (2010) Cost-Minimizing Choice Behavior in Transportation Planning: A Theoretical. Page 8-10.

V.Goyal, S.K.(1984). Improving VAM for unbalanced transportation problem. Journal of Operational Research Society. 35(12), 1113-1114.

VI.Hadley, G., (1972). Linear Programming, Addition-Wesley Publishing Company, Massachusetts.

VII.Hemaida, R. & Kwak, N. K. (1994). A linear goal programming model for transshipment problems with flexible supply and demand constraints. Journalof Operational Research Society, 45(2), 1994, 215-224.

VIII.Hitchcock, F.L.(1941). The distribution of a product from several sources to numerous localities. Journal of Mathematics & Physics. 20, 224-230.

IX.Kvanli, A. (1980). Financial planning using goal programming. Omega, 8, 207-218.

X.Kwak, N.K. & Schniederjans, M.J.(1979) “A goal programming model for improved transportation problem solutions,” Omega, 12, 367-370.

XI.Lee, S.M., (1972). Goal Programming for Decision Analysis, Auerbach, Philadelphia.

XII.M.A .Hakim, M. A. Hossen, M. Sarif Uddin (2016),A credit policy approach of an inventory model for deteriorating item with price and time dependent demandaccepted for publication inJournal of Mechanics of Continua and Mathematical Sciences, ISSN 0973-8975,Volume -10 No. -2 .

XIII.Tolstoi, A.N. (1939). Methody ustraneniya neratsional’nykh perevozok pri planirovanii [Russian; Methods of removing irrational transportation in planning], Sotsialisticheskii Transport 9, 28-51 [also published a ‘pamphlet’: Methods of Removing Irrational Transportation in the construction of Operations Plans], Transzheldorizdat, Moscow, 1941.

XIV.V K Kapoor ,Operation Research (Problem and solution) ,sultan chand &sons, educational publishers ,new delhi.

XV.Veena Adlakha and Krzysztof Kowalski (2001), A heuristic method for more –for-less in distribution related problems, International Journal of Mathematical Education in Science and Technology, 32 61-71.

M. A. Hossen, Farjana Binte Noor View Download