scholarly journals Optimization of total transportation cost

2020 ◽  
Vol 26 (1) ◽  
pp. 57-63
Author(s):  
Adamu Isah Kamba ◽  
Suleiman Mansur Kardi ◽  
Yunusa Kabir Gorin Dikko
Keyword(s):  
Transportation Problem ◽  
Research Work ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Strategic Decision ◽  
Distribution Method ◽  
North West ◽  
Total Transportation Cost ◽  
Transportation Schedule ◽  
Furniture Factory

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.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

scholarly journals PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S APPROXIMATION METHOD (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI) PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI)

2017 ◽  
Author(s):  
Tri Tri Hernawati
Keyword(s):  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Initial Solution ◽  
Final Solution ◽  
Distribution Method ◽  
Initial Cost ◽  
Cost Distribution ◽  
Distribution Cost

AbstractThe research is aimed at analyzing the implementation of distribution transportation method and finding out the saving of distribution transportation cost by using Vogel’s Approximation Method and Modified Distribution Method (MODI). The research used Vogel’s Approximation Method as the initial solution and Modified Distribution Method as the final solution to save distribution transportation cost. Implementation of combination, Vogel’s Approximation Method and Modified Distribution Method is a system will be develop to find the results of calculation of the initial cost of distribution, a minimum cost distribution, and allocation of items to be distributed from the origin place to the destination place. Entry data by user is origin place (many place and name of place), destination place (many place and name of place), amount of supply from the each origin, amount of demand from the each destination, and distribution cost from the each origin to the each destination. The result of the research shows minimalizing total distribution cost about 10,7%

scholarly journals A NEW APPROACH TO FIND THE INITIAL BASIC FEASIBLE SOLUTION OF A TRANSPORTATION PROBLEM

2018 ◽  
Vol 6 (5) ◽  
pp. 321-325 ◽  
Author(s):  
Ravi Kumar R ◽  
Radha Gupta ◽  
Karthiyayini O
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
Cost Minimization ◽  
Optimization Technique ◽  
Transportation Cost ◽  
Basic Feasible Solution ◽  
Standard Methods ◽  
North West ◽  
A New Technique ◽  
Optimum Solution

Transportation problem (TP) in operations research is a widely used optimization technique to study the problems concerned with transporting goods from production places to sale points. The TP may have one or more objectives such as minimization of transportation cost, minimization of distance with respect to time, and so on. There is a systematic method to solve such problems. For this, we find the Initial Basic Feasible Solution (IBFS) to the given problem. North West corner method, least cost method, Vogel’s approximation method are the standard methods one uses to find the IBFS.  In recent years, there are several other methods are proposed to solve such problems. In this paper, we propose a new technique named as Direct Sum Method (DSM) and its effectiveness is compared with the standard methods. The result shows that it is easy to compute and near to the optimum solution of the problem.

An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions

2020 ◽  
Vol 37 (05) ◽  
pp. 2050024 ◽  
Author(s):  
Fanrong Xie ◽  
Zuoan Li
Keyword(s):  
Transportation Problem ◽  
Cost Minimization ◽  
Unit Cost ◽  
Iterative Algorithms ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Maximum Flow ◽  
Iterative Solution ◽  
Solution Technique ◽  
Capacitated Transportation Problem

The average transportation cost minimization of capacitated transportation problem with bounds on rim conditions (CTPBRC) is an important optimization problem due to the requirement of low unit cost consumption in production system. In the literature, there is only one approach to solving a special case of this problem, but it is not applicable to the general case. In this paper, this problem is reduced to a series of finding the minimum cost maximum flow in a network with lower and upper arc capacities, and two iterative algorithms are proposed as more generalized solution method for this problem as compared to the existing approach. Computational experiments on randomly generated instances validate that the two iterative algorithms are generally able to find the minimum average transportation cost solution to CTPBRC efficiently for the general case, in which one iterative algorithm has higher efficiency than the other for large size instances.

Trapezoidal fuzzy model to optimize transportation problem

2016 ◽  
Vol 07 (03) ◽  
pp. 1650028 ◽  
Author(s):  
Nirbhay Mathur ◽  
Pankaj Kumar Srivastava ◽  
Ajit Paul
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Fuzzy Model ◽  
Optimal Solution ◽  
Transportation Cost ◽  
New Method ◽  
Trapezoidal Fuzzy Numbers ◽  
North West ◽  
Fuzzy Environment ◽  
Practical Usefulness

The main aim of this paper is to develop an approach based on trapezoidal fuzzy numbers to optimize transportation problem in fuzzy environment. The present algorithm has representation of availability, demand and transportation cost as trapezoidal fuzzy numbers. This algorithm is found quicker in terms of runtime as comparison to fuzzy VAM discussed in [Kaur A., Kumar A., A new method for solving fuzzy transportation problem using ranking function, Appl. Math. Model. 35:5652–5661, 2011; Ismail Mohideen S., Senthil Kumar P., A comparative study on transportation problem in fuzzy environment, Int. J. Math. Res. 2:151–158, 2010]. On the other hand this technique gives much better results than some classical methods like north-west corner and least cost method. Another benefit of this algorithm is that for certain transportation problems it directly gives optimal solution. It is one of the simplest methods to apply and perceive. Practical usefulness of the new method over other existing methods is demonstrated with two numerical examples.

scholarly journals Application of fuzzy programming techniques to solve solid transportation problem with additional constraints

2020 ◽  
Vol 30 (1) ◽  
Author(s):  
Sharmistha Halder (Jana) ◽  
Biswapati Jana
Keyword(s):  
Transportation Problem ◽  
Real Life ◽  
Transportation Cost ◽  
Fuzzy Programming ◽  
Solid Transportation Problem ◽  
Generalized Gradient ◽  
Proposed Model ◽  
Programming Techniques ◽  
Total Transportation Cost ◽  
Additional Constraints

An innovative, real-life solid transportation problem is explained in a non-linear form. As in real life, the total transportation cost depends on the procurement process or type of the items and the distance of transportation. Besides, an impurity constraint is considered here. The proposed model is formed with fuzzy imprecise nature. Such an interesting model is optimised through two different fuzzy programming techniques and fractional programming methods, using LINGO-14.0 tools followed by the generalized gradient method. Finally, the model is discussed concerning these two different methods.

scholarly journals An Empirical Study on Multi-objective Transportation Problem in Fuzzy Environment

2018 ◽  
Vol 7 (4.38) ◽  
pp. 748
Author(s):  
Manoranjan Mishra ◽  
Debdulal Panda
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Fuzzy Rule ◽  
Transportation Cost ◽  
Transportation System ◽  
Vital Role ◽  
Multi Objective ◽  
Transportation Models ◽  
Total Transportation Cost ◽  
Single Objective

For both in economical and social development of country transportation system plays a vital role. As it is directly involved with financial growth of the country, for that a complete well planned transportation infrastructure is necessary. Most of the transportation models are formulated with minimization of transportation cost as the basic objective. But consideration of transportation system with a single objective is not able to meet the various requirements of transportation industry for which it may not lead to the practical optimal solution. It bounds the decision makers (DMs) to consider several objectives at a time instead of single objective. To handle a multi-objective transportation problem with fixed parameters is a challenging issue; rather it is easy to consider all parameters in terms of linguistic variables. In this paper, a multi criteria multi-objective transportation models is formulated based on fuzzy relations under the fuzzy logic with several objectives like (i) minimization of total transportation cost and (ii) minimization of total transportation time. Another objective, maximization of the transported amount from a source to a destination is determined on the basis of previous two objectives. All the objectives are associated with multiple numbers of criteria like breakable items, shipping distance, service charge, mode of transportation etc. These relations are imprecise in nature and represented in terms of verbal words such as low, medium, high and very high. The fuzzy rule based multi-objective transportation problem is formulated and result is discussed. 

scholarly journals PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S APPROXIMATION METHOD (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI)

2018 ◽  
Author(s):  
Tri Tri Hernawati
Keyword(s):  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Initial Solution ◽  
Final Solution ◽  
Distribution Method ◽  
Initial Cost ◽  
Cost Distribution ◽  
Distribution Cost

The research is aimed at analyzing the implementation of distribution transportation method and finding out the saving of distribution transportation cost by using Vogel’s Approximation Method and Modified Distribution Method (MODI). The research used Vogel’s Approximation Method as the initial solution and Modified Distribution Method as the final solution to save distribution transportation cost. Implementation of combination, Vogel’s Approximation Method and Modified Distribution Method is a system will be develop to find the results of calculation of the initial cost of distribution, a minimum cost distribution, and allocation of items to be distributed from the origin place to the destination place. Entry data by user is origin place (many place and name of place), destination place (many place and name of place), amount of supply from the each origin, amount of demand from the each destination, and distribution cost from the each origin to the each destination. The result of the research shows minimalizing total distribution cost about 10,7%The research is aimed at analyzing the implementation of distribution transportation method and finding out the saving of distribution transportation cost by using Vogel’s Approximation Method and Modified Distribution Method (MODI). The research used Vogel’s Approximation Method as the initial solution and Modified Distribution Method as the final solution to save distribution transportation cost. Implementation of combination, Vogel’s Approximation Method and Modified Distribution Method is a system will be develop to find the results of calculation of the initial cost of distribution, a minimum cost distribution, and allocation of items to be distributed from the origin place to the destination place. Entry data by user is origin place (many place and name of place), destination place (many place and name of place), amount of supply from the each origin, amount of demand from the each destination, and distribution cost from the each origin to the each destination. The result of the research shows minimalizing total distribution cost about 10,7%

Fuzzy Transportation Problem by Using Triangular, Pentagonal and Heptagonal Fuzzy Numbers With Lagrange's Polynomial to Approximate Fuzzy Cost for Nonagon and Hendecagon

2020 ◽  
Vol 9 (1) ◽  
pp. 112-129
Author(s):  
Ashok Sahebrao Mhaske ◽  
Kirankumar Laxmanrao Bondar
Keyword(s):  
Transportation Problem ◽  
Operational Research ◽  
Fuzzy Numbers ◽  
Real Life ◽  
Transportation Cost ◽  
Fuzzy Transportation Problem ◽  
Total Transportation Cost ◽  
Fuzzy Cost

The transportation problem is a main branch of operational research and its main objective is to transport a single uniform good which are initially stored at several origins to different destinations in such a way that the total transportation cost is minimum. In real life applications, available supply and forecast demand, are often fuzzy because some information is incomplete or unavailable. In this article, the authors have converted the crisp transportation problem into the fuzzy transportation problem by using various types of fuzzy numbers such as triangular, pentagonal, and heptagonal fuzzy numbers. This article compares the minimum fuzzy transportation cost obtained from the different method and in the last section, the authors introduce the Lagrange's polynomial to determine the approximate fuzzy transportation cost for the nanogon (n = 9) and hendecagon (n = 11) fuzzy numbers.

Sign in / Sign up

Export Citation Format

Share Document