scholarly journals Some aspects on solving transportation problem

2020 ◽  
Vol 30 (1) ◽  
pp. 45-57
Author(s):  
A. Das ◽  
D Deepmala ◽  
R. Jana
Keyword(s):  
Convex Function ◽  
Assignment Problem ◽  
Transportation Problem ◽  
Special Structure ◽  
Sample Surveys ◽  
Cost Component ◽  
Weighted Version ◽  
Transportation Problems ◽  
North West ◽  
Corner Solution

In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices to these transportation problems are of special structure. We observe that the optimality of North West corner solution holds for the problem where cost component is replaced by a convex function. We revisit assignment problem and present a weighted version of K?nig-Egerv?ry theorem. Finally, we propose weighted Hungarian method to solve the transportation problem.

scholarly journals An Inventive Approach to Optimize Fuzzy Transportation Problem

2020 ◽  
Vol 5 (5) ◽  
pp. 985-994
Author(s):  
Nirbhay Mathur ◽  
Pankaj Kumar Srivastava
Keyword(s):  
Transportation Problem ◽  
Solution Process ◽  
Innovative Approach ◽  
Numerical Examples ◽  
Transportation Problems ◽  
North West ◽  
Fuzzy Environment ◽  
Innovative Method ◽  
Fuzzy Transportation Problem

The present paper wraps an innovative approach to optimize transportation problems through generalized trapezoidal numbers in a fuzzy environment. The main contribution here is to develop an innovative method to optimize the generalized fuzzy trapezoidal transportation problem and reduce the computational intricacy of the existing methods. Then again this method confers many improved results against classical North-West Corner and Least-Cost schemes in Fuzzy environment. An additional merit of the proposed scheme is that for several fuzzy transportation problems it furnishes the best possible way out directly. It is simple to understand and apply. The solution process is exemplified through two numerical examples and comparison with some standard existing methods.

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 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.

Methods for Solving Fully Fuzzy Transportation Problems Based on Classical Transportation Methods

2013 ◽  
pp. 328-347 ◽  
Author(s):  
Amit Kumar ◽  
Amarpreet Kaur
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Real Life ◽  
Optimal Solution ◽  
Fuzzy Linear Programming ◽  
Programming Formulation ◽  
Transportation Problems ◽  
Fuzzy Optimal Solution ◽  
Linear Programming Formulation ◽  
Fuzzy Transportation Problem

There are several methods, in literature, for finding the fuzzy optimal solution of fully fuzzy transportation problems (transportation problems in which all the parameters are represented by fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings, two new methods (based on fuzzy linear programming formulation and classical transportation methods) are proposed to find the fuzzy optimal solution of unbalanced fuzzy transportation problems by representing all the parameters as trapezoidal fuzzy numbers. The advantages of the proposed methods over existing methods are also discussed. To illustrate the proposed methods a fuzzy transportation problem (FTP) is solved by using the proposed methods and the obtained results are discussed. The proposed methods are easy to understand and to apply for finding the fuzzy optimal solution of fuzzy transportation problems occurring in real life situations.

A Novel Ranking Approach to Solving Fully LR-Intuitionistic Fuzzy Transportation Problems

2018 ◽  
Vol 15 (01) ◽  
pp. 95-112 ◽  
Author(s):  
Abhishekh ◽  
A. K. Nishad
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Solution Procedure ◽  
Ranking Functions ◽  
Transportation Problems ◽  
Intuitionistic Fuzzy Numbers ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Environment ◽  
Fuzzy Transportation Problem

To the extent of our knowledge, there is no method in fuzzy environment to solving the fully LR-intuitionistic fuzzy transportation problems (LR-IFTPs) in which all the parameters are represented by LR-intuitionistic fuzzy numbers (LR-IFNs). In this paper, a novel ranking function is proposed to finding an optimal solution of fully LR-intuitionistic fuzzy transportation problem by using the distance minimizer of two LR-IFNs. It is shown that the proposed ranking method for LR-intuitionistic fuzzy numbers satisfies the general axioms of ranking functions. Further, we have applied ranking approach to solve an LR-intuitionistic fuzzy transportation problem in which all the parameters (supply, cost and demand) are transformed into LR-intuitionistic fuzzy numbers. The proposed method is illustrated with a numerical example to show the solution procedure and to demonstrate the efficiency of the proposed method by comparison with some existing ranking methods available in the literature.

scholarly journals Dichotomized Incenter Fuzzy Triangular Ranking Approach to Optimize Interval Data Based Transportation Problem

2018 ◽  
Vol 18 (4) ◽  
pp. 111-119 ◽  
Author(s):  
Pankaj Kumar Srivastava ◽  
Dinesh C. S. Bisht
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Interval Data ◽  
Transportation Problems ◽  
Research Article

Abstract This research article discusses the problems having flexible demand, supply and cost in range referred as interval data based transportation problems and these cannot be solved directly using available methods. The uncertainty associated with these types of problems motivates authors to tackle it by converting interval to fuzzy numbers. This confront of conversion has been achieved by proposing a dichotomic fuzzification approach followed by a unique triangular incenter ranking approach to optimize interval data based transportation problems. A comparison with existing methods is made with the help of numerical illustrations. The algorithm proposed is found prompt in terms of the number of iteration involved and problem formation. This method is practical to handle the transportation problems not having a single valued data, but data in form of a range.

scholarly journals A review on fuzzy and stochastic extensions of the multi index transportation problem

2017 ◽  
Vol 27 (1) ◽  
pp. 3-29 ◽  
Author(s):  
Sungeeta Singh ◽  
Renu Tuli ◽  
Deepali Sarode
Keyword(s):  
Transportation Problem ◽  
Real Life ◽  
Review Article ◽  
Fixed Charge ◽  
Fixed Cost ◽  
Multi Index ◽  
Transportation Problems ◽  
Single Criterion ◽  
Fixed Charge Transportation Problem

The classical transportation problem (having source and destination as indices) deals with the objective of minimizing a single criterion, i.e. cost of transporting a commodity. Additional indices such as commodities and modes of transport led to the Multi Index transportation problem. An additional fixed cost, independent of the units transported, led to the Multi Index Fixed Charge transportation problem. Criteria other than cost (such as time, profit etc.) led to the Multi Index Bi-criteria transportation problem. The application of fuzzy and stochastic concept in the above transportation problems would enable researchers to not only introduce real life uncertainties but also obtain solutions of these transportation problems. The review article presents an organized study of the Multi Index transportation problem and its fuzzy and stochastic extensions till today, and aims to help researchers working with complex transportation problems.

scholarly journals A Network Flow Algorithm for Solving Generalized Assignment Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yongwen Hu ◽  
Qunpo Liu
Keyword(s):  
Network Model ◽  
Open Problem ◽  
Assignment Problem ◽  
Network Flow ◽  
Numerical Experiments ◽  
Large Range ◽  
Special Structure ◽  
Generalized Assignment Problem ◽  
Generalized Assignment ◽  
Flow Algorithm

The generalized assignment problem (GAP) is an open problem in which an integer k is given and one wants to assign k ′ agents to k k ′ ≤ k jobs such that the sum of the corresponding cost is minimal. Unlike the traditional K -cardinality assignment problem, a job can be assigned to many, but different, agents and an agent may undertake several, but different, jobs in our problem. A network model with a special structure of GAP is given and an algorithm for GAP is proposed. Meanwhile, some important properties of the GAP are given. Numerical experiments are implemented, and the results indicate that the proposed algorithm can globally and efficiently optimize the GAP with a large range cost.

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 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.

Sign in / Sign up

Export Citation Format

Share Document