scholarly journals Statistical Methods for Solving Transportation Problems

2019 ◽  
Vol 25 (2) ◽  
pp. 10-13
Author(s):  
Alina Baboş
Keyword(s):  
Linear Programming ◽  
Statistical Methods ◽  
Approximation Method ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Basic Feasible Solution ◽  
Statistical Tools ◽  
Numerical Examples ◽  
North West ◽  
Shipping Cost

Abstract Transportation problem is one of the models of Linear Programming problem. It deals with the situation in which a commodity from several sources is shipped to different destinations with the main objective to minimize the total shipping cost. There are three well-known methods namely, North West Corner Method Least Cost Method, Vogel’s Approximation Method to find the initial basic feasible solution of a transportation problem. In this paper, we present some statistical methods for finding the initial basic feasible solution. We use three statistical tools: arithmetic and harmonic mean and median. We present numerical examples, and we compare these results with other classical methods.

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.

scholarly journals Fundamentals of Transportation Problem

2021 ◽  
Vol 10 (5) ◽  
pp. 90-103
Author(s):  
Bhabani Mallia ◽  
Manjula Das ◽  
C. Das
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Optimal Solution ◽  
Optimal Solutions ◽  
Basic Feasible Solution ◽  
Distribution Method

Transportation Problem is a linear programming problem. Like LPP, transportation problem has basic feasible solution (BFS) and then from it we obtain the optimal solution. Among these BFS the optimal solution is developed by constructing dual of the TP. By using complimentary slackness conditions the optimal solutions is obtained by the same iterative principle. The method is known as MODI (Modified Distribution) method. In this paper we have discussed all the aspect of transportation problem.

scholarly journals A Comparative Study of Solving Methods of Transportation Problem in Linear Programming Problem

2020 ◽  
pp. 45-67
Author(s):  
Farzana Sultana Rafi ◽  
Safiqul Islam
Keyword(s):  
Linear Programming ◽  
Comparative Study ◽  
Programming Problem ◽  
Approximation Method ◽  
Linear Programming Problem ◽  
Transportation Problem ◽  
Optimal Result ◽  
North West ◽  
C Programming

The paper is related with the basic transportation problem (TP)which is one kind of linear programming problem (LPP). There are some existing methods for solving transportation problem and in this paper all the standard existing methods has been discussed to understand which one is the best method among them. Among all of existing methods, the Vogel’s Approximation Method (VAM) is considered the best method which gives the better optimal result then other methods and North-West Corner Rule is considered as simplest but gives worst result. A C programming code for Vogel’s Approximation Method have been added in the appendix.

scholarly journals A Modern Approach For Finding Minimization Cost In Transportation Problem

2021 ◽  
Vol 12 (1S) ◽  
pp. 319-322
Author(s):  
G. Padma karthiyayini, Et. al.
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
Transportation Cost ◽  
Basic Feasible Solution ◽  
Modern Approach ◽  
New Approach ◽  
Numerical Examples

In this paper, the proposed technique is new and simple for obtaining an initial basic feasible solution (IBFS) of a transportation problem (TP).  The objective of this paper is to find how to minimize the transportation cost (TC) by using a new approach.  The method is illustrated with some numerical examples using algorithm.

Sign in / Sign up

Export Citation Format

Share Document