期刊文献+

A Comparative Study of Initial Basic Feasible Solution by a Least Cost Mean Method (LCMM) of Transportation Problem 被引量:1

A Comparative Study of Initial Basic Feasible Solution by a Least Cost Mean Method (LCMM) of Transportation Problem
下载PDF
导出
摘要 Transportation Problems (TP), as is known, are a basic network problem which can be formulated as a Linear Programming Problem (LPP). Transportation networks are built up in order to save transportation cost. In the solution procedure of a TP, finding an Initial Basic Feasible Solution (IBFS) is necessary to obtain the optimal solution. Optimality gives us the optimal route that prompts either most extreme benefit or least aggregate cost whichever is required. In this research paper, a new method named Least Cost Mean Method is proposed to obtain a better IBFS where row penalty and column penalty is brought out by the mean of lowest and next lowest cost of each row and each column of the cost matrix. The method is illustrated with numerical examples. To verify the performance of the proposed method, a comparative study is also carried out and observed that it is computationally easier and yielding comparatively better solution. Transportation Problems (TP), as is known, are a basic network problem which can be formulated as a Linear Programming Problem (LPP). Transportation networks are built up in order to save transportation cost. In the solution procedure of a TP, finding an Initial Basic Feasible Solution (IBFS) is necessary to obtain the optimal solution. Optimality gives us the optimal route that prompts either most extreme benefit or least aggregate cost whichever is required. In this research paper, a new method named Least Cost Mean Method is proposed to obtain a better IBFS where row penalty and column penalty is brought out by the mean of lowest and next lowest cost of each row and each column of the cost matrix. The method is illustrated with numerical examples. To verify the performance of the proposed method, a comparative study is also carried out and observed that it is computationally easier and yielding comparatively better solution.
作者 Md. Munir Hossain Mollah Mesbahuddin Ahmed Md. Munir Hossain;Mollah Mesbahuddin Ahmed(Department of Mathematics, Bangladesh Military Academy, Chattogram, Bangladesh;Birshreshtha Noor Mohammad Public College, Dhaka, Bangladesh)
出处 《American Journal of Operations Research》 2020年第4期122-131,共10页 美国运筹学期刊(英文)
关键词 Initial Basic Feasible Solution Optimum Solution Penalty Cost Initial Basic Feasible Solution Optimum Solution Penalty Cost
  • 相关文献

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部