Application of a New Transportation Algorithm for Cost Minimization (original) (raw)

An Alternative Method to Minimize the Transportation Cost

https://www.ijrrjournal.com/IJRR\_Vol.4\_Issue.5\_May2017/Abstract\_IJRR0015.html, 2017

The main objective of transportation problem (TP) solution methods is to minimize the cost / time of transportation. Most of the currently used methods for solving transportation problems are trying to reach the optimal solution and most of those methods are considered complex. In this paper a new method is proposed for finding initial basic feasible solution (IBFS) also optimal or near to optimal cost for transportation directly. Here a moderate table called least entry table (LET) is formed by subtracting smallest odd cost from other odd cost and then divide all entries by common factors, Later the Decision Making Indicators (DMI) are calculated from the difference of the greatest unit cost and the nearest-to-the-greatest unit cost. The least entry of the DMI along the highest DMI is taken as the basic cell. Finally, loads have been imposed on the original TT corresponding to the basic cells of the DMI. So, it performs faster than the existing methods with a minimal computation time. Also this method will be very lucrative for those decision makers who are dealing with logistics and supply chain related issues.

Use of a New Transportation Algorithm for Profit Maximization

A transportation calculation is advanced, and it makes it possible to be able to effectively plan the assets with the end goal of augmenting the benefit of an assembling organization. The distribution indicators (DI) have been resolved from the distinction of the bigger unit profit and the average value of total unit profit of each row and column. Also, the area of the fundamental cells has been resolved as the biggest entrance of the transportation table (TT) along the biggest DI. The most extreme benefit given by this calculation is closer to the other benefit. The strategy, however, is represented with numerical examples to legitimize its proficiency.

A New Approach to Solve Transportation Problems with the Max Min Total Opportunity Cost Method

International Journal of Mathematics Trends and Technology

In this paper, we are trying to find the optimum solution of a transportation problem and is to minimize the cost. The current new algorithmic approach to solve the transportation problem is based upon the Total Opportunity Cost (TOC) of a transportation table (TT) and maximum minimum penalty approach. The most attractive feature of this method is that it requires very simple arithmetical and logical calculation, which compared to the existing method an optimal solution and illustrated with numerical example.

Optimization of total transportation cost

Global Journal of Pure and Applied Sciences

In this research work, the study used transportation problem techniques to determine minimum cost of transportation of Gimbiya Furniture Factory using online software, Modified Distribution Method (MODI). The observation made was that if Gimbiya furniture factory, Birnin Kebbi could apply this model to their transportation schedule, it will help to minimize transportation cost at the factory to ₦1,125,000.00 as obtained from North west corner method, since it was the least among the two methods, North west corner method and Least corner method. This transportation model willbe useful for making strategic decision by the logistic managers of Gimbiya furniture factory, in making optimum allocation of the production from the company in Kebbi to various customers (key distributions) at a minimum transportation cost. Keywords: North West corner, Least corner, Transportation problem, minimum transportation.

An Effective Modification to Solve Transportation Problems: A Cost Minimization Approach

It is well-known that Linear Programming Problem (LPP) is one of the most potential mathematical tools for efficient allocation of operational resources. Many problems in real situation can be formulated as LPP. When a situation can be entirely modeled as a network, very efficient algorithms exist for the solution of the optimization problem which is many times more efficient than the solution methods of LPP. Transportation problems (TP), as is known, are a basic network problem which can be formulated as a LPP. The main objective of TP is to minimize the transportation cost of distributing a product from a number of sources (e.g. factories) to a number of destinations (e.g. ware houses). It is to be mentioned that Balanced TP and Unbalanced TP are the types of TP. If the sum of the supplies of all the sources is equal to the sum of the demands of all the destinations, the problem is termed as a balanced transportation problem. Again, if the sum of the supplies of all the sources is not equal to the sum of the demand of all the destinations, the problem is termed as unbalanced transportation problem. Here we have developed a new method of finding an Initial Basic Feasible Solution (IBFS) for both the Balanced TP and Unbalanced TP.

Sequentially Updated Weighted Cost Opportunity Based Algorithm in Transportation Problem

GANIT: Journal of Bangladesh Mathematical Society, 2019

Transportation models are of multidisciplinary fields of interest. In classical transportation approaches, the flow of allocation is controlled by the cost entries and/or manipulation of cost entries – so called Distribution Indicator (DI) or Total Opportunity Cost (TOC). But these DI or TOC tables are formulated by the manipulation of cost entries only. None of them considers demand and/or supply entry to formulate the DI/ TOC table. Recently authors have developed weighted opportunity cost (WOC) matrix where this weighted opportunity cost matrix is formulated by the manipulation of supply and demand entries along with cost entries as well. In this WOC matrix, the supply and demand entries act as weight factors. Moreover by incorporating this WOC matrix in Least Cost Matrix, authors have developed a new approach to find out Initial Basic Feasible Solution of Transportation Problems. But in that approach, WOC matrix was invariant in every step of allocation procedures. That is, afte...

Transportation Cost Minimization of a Manufacturing Firm Using Linear Programming Technique

Advanced Materials Research, 2011

This paper utilizes a linear programming technique in solving the transportation problem of a beverage producing company in Nigeria with a view to minimizing the total transportation cost and obtaining an optimal schedule bearing in mind the present transportation policy of the company. This work became necessary because it was discovered that the transportation costing policies of the company under study were not based on results obtained from sophisticated mathematical modeling but from rule-of-thumb methods. Transportation cost data from the peak period in the year under study were analyzed and linear programming methods were employed in finding the routes that will optimize total transportation cost of the company. From the company’s data, two transportation matrices were formulated and analyzed with optimal solutions of N 8,889,000 and N 13,989,000 giving a cost reduction of N 6,363,586 and N 1,263,586 respectively when compared with the company’s present transportation cost of...

Transportation Cost Optimization

Academic Journal of Interdisciplinary Studies, 2015

Many manufacturing make their products in few locations and ship them to many different locations. In this paper we use Evolver, Excel Solver and Microsoft Solver Foundation in order to optimize transportation cost or to find the cheaper way to make and ship products to the customers and meet customers' demands. "Proplast" company that manufactures doors and windows is located in three different places; in Ferizaj, Pristina and Prizren and supplies 9 shops in Kosovë, Albania, Macedonia, Montenegro and Serbia. Mathematically speaking, our goal is to find minimal transportation cost and this problem will be set up as a linear programming model with the below definition: * Minimize total production and transportation cost; * Constraints:-The amount shipped from each factory cannot exceed plant capacity,-Every shop must receive its required demand,-Transportation trucks have the limit of loading quantity and-Each shipping amount must be nonnegative. We will show Evolver, Excel Solver and Microsoft Solver Foundation results and will find the least expensive way. Also we will compare minimum and maximum cost for all software's.

A Competent Algorithm to Minimize the Transportation Time

The general transportation problem (TP) is concerned with determining an optimal strategy for distributing a commodity from a group of supply centers, such as factories to various receiving centers, in such a way as to minimize the cost and time. Here a new model to minimize the transportation time has been studied. A new algorithm is developed to determine the initial Basic Feasible Solution (IBFS) to minimize time. Firstly, it is constructed time minimizing least entry table (TMLET) by subtracting least odd cost from other odd cost and divide by common factor. Then Row Decision Making Indicators (RDMI) and Column Decision Making Indicators (CDMI) are calculated by the difference of the greatest time unit and the nearest-to-greatest time unit. Then the least entry of TMLET along the highest RDMI/CDMI is taken as the basic cell. Finally load have been imposed in the original transportation table and the minimum time is calculated as Max unit in to the Original transportation table of allocated cell. In this paper it is compared the time obtained by the propose method with regular methods.

Annals of An Effective Modification to Solve Transportation Problems : A Cost Minimization Approach

2014

Abstract. It is well-known that Linear Programming Problem (L PP) is one of the most potential mathematical tools for efficient allocati on of operational resources. Many problems in real situation can be formulated as LPP . When a situation can be entirely modeled as a network, very efficient algorithms exi st for the solution of the optimization problem which is many times more efficient than the solution methods of LPP. Transportation problems (TP), as is known, are a ba sic network problem which can be formulated as a LPP. The main objective of TP is to minimize the transportation cost of distributing a product from a number of sources (e. g. factories) to a number of destinations (e.g. ware houses). It is to be mentio ned that Balanced TP and Unbalanced TP are the types of TP. If the sum of the supplies of all the sources is equal to the sum of the demands of all the destinations, the problem is termed as a balanced transportation problem. Again, if the sum of the supplies of a...