Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.
Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to analyze and minimize transportation cost. This problem is well discussed in operation research for its wide application in various fields, such as scheduling, personnel assignment, product mix problems and many others, so that this problem is really not confined to transportation or distribution only. In the solution procedure of a transportation problem, finding an initial basic feasible solution is the prerequisite to obtain the optimal solution. Again, development is a continuous and endless process to find the best among the bests. The growing complexity of management calls for development of sound methods and techniques for solution of the problems. Considering these factors, this research aims to propose an algorithm "Incessant Allocation Method" to obtain an initial basic feasible solution for the transportation problems. Several numbers of numerical problems are also solved to justify the method. Obtained results show that the proposed algorithm is effective in solving transportation problems.
Minimization of transportation time is a great concern of the transportation problems like the cost minimizing transportation problems. In this writing, a transportation algorithm is developed and applied to obtain an Initial Basic Feasible Solution (IBFS) of transportation problems in minimizing transportation time. The developed method has also been illustrated numerically to test the efficiency of the method where it is observed that the proposed method yields a better result.
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.
This article explains how a company manages its business to gain minimum inventory cost and reaches its business success by using Third Party Logistics. Applying Third Party Logistics the company may put its eyes on its production process and marketing smoothly. Thereby, the inventory cost might be reduced substantially. By applying this technique, mainly it can reduce the clerical cost, security staff cost and depreciation cost among the various costs mentioned in the paper subsequently. And to get the optimum level the party uses its few tools like database software. It also expresses a mathematical framework to understand the performance of the company and put the arguments that inventory cost minimization method is an approach that helps it to be competitive and successful in the business arena. To establish a new model in this paper, Probabilistic Continuous Economic Order Quantity (EOQ) Model is used as a baseline.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.