Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for findin...Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem. Number of numerical illustration is introduced and optimality of the result is also checked. Comparison of findings obtained by the new heuristic and the existing heuristics show that the method presented herein gives a better result.展开更多
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 s...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 of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem. Number of numerical illustration is introduced and optimality of the result is also checked. Comparison of findings obtained by the new heuristic and the existing heuristics show that the method presented herein gives a better result.
文摘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.
