Result: The optimal solution: Conclusion: it is optimal to ship 100 units from Factory 1 to Customer 2, 100 units from Factory 2 to Customer 2, 100 units from Factory 2 to Customer 3, 200 units from Factory 3 to Customer 1 and 100 units from Factory 3 to Customer 3.

Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. Again, some of the well reputed methods for finding an initial basic feasible solution of transportation problems developed and discussed by them are North West Corner Method (NWCM) [9] , Row Minimum Method (RMM) [6] [26] , Column Minimum Method (CMM) [6] [26] , Least Cost Method (LCM) [9] , Vogel’s Approximation Method (VAM) [9] [24] , Extremum Difference Method (EDM) [10] , Highest Cost Difference Method (HCDM) [5] [6] , Average Cost Method (ACM) [4] , TOCM-MMM Approach [11] , TOCM-VAM Approach [13] , TOCM-EDM Approach [15] , TOCM-HCDM Approach [14] , TOCM-SUM Approach [7] etc.

Received 24 November 2015; accepted 1 March 2016; published 4 March 2016 1. There are m sources and n destinations, each represented by a node. The objective function minimizes the total cost of transportation (Z) between various sources and destinations. (2014) Advanced Vogel’s Approximation Method (AVAM): A New Approach to Determine Penalty Cost for Better Feasible Solution of Transportation Problem.

Introduction Transportation problem is famous in operation research for its wide application in real life. The arcs represent the routes linking the sources and destinations. The constraint i in the first set of constraints ensures that the total units transported from the source i is less than or equal to its supply. International Journal of Engineering Research & Technology (IJERT), 3, 182-187.

To learn more or modify/prevent the use of cookies, see our Cookie Policy and Privacy Policy.

## Solve Transportation Problem Essay Questions In American History

uses cookies to personalize content, tailor ads and improve the user experience. By continuing to use this site, you consent to the use of cookies.We use cookies to offer you a better experience, personalize content, tailor advertising, provide social media features, and better understand the use of our services.In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. In this paper, a new algorithm is proposed to find an initial basic feasible solution for the transportation problems.The method is also illustrated with numerical examples. [21] -[23] , Pandian & Natarajan [24] , Reinfeld & Vogel [25] , Sayedul Anam et al. A comparative study is also carried out by solving a good number of transportation problems which shows that the proposed method gives better result in comparison to the other existing heuristics available in the literature. Network Representation and Mathematical Model of Transportation Problem Generally the transportation model is represented by the network in Figure 1.・ Phase 2: Finding an initial basic feasible solution. If there is no odd cost in the cost cells of the TT, keep on dividing all the cost cells by 2 (two) till obtaining at least an odd value in the cost cells. ・ Phase 3: Optimize the initial basic feasible solution which is obtained in Phase 2. [9] , Kasana & Kumar [10] , Kirca and Satir [11] , M. ・ Step-4: Form a new table which is to be known as allocation table (AT) by keeping the MOC in the respective cost cell/cells as it was/were, and subtract selected MOC only from each of the odd cost valued cells of the TT. We use cookies to make interactions with our website easy and meaningful, to better understand the use of our services, and to tailor advertising.For further information, including about cookie settings, please read our Cookie Policy .Detailed information on how Wiley uses cookies can be found in our Privacy Policy.Formulate the Model | Trial and Error | Solve the Model Use the solver in Excel to find the number of units to ship from each factory to each customer that minimizes the total cost.

## Comments Solve Transportation Problem

## Transportation problem using vogel's approximation method calculator

Check different types of Transportation problem examples. Algorithm and examples. Solve transportation problem using vogel's approximation method.…

## Solving the Transportation Problem - Jstor

Referred to as the Hitchcock-Koopmans transportation problem. In 1951, G. B. veloped by H. Kuhn 5, 6 for solving the optimal assignment problem a special.…

## Solving a two-objective green transportation problem by using meta.

Jan 12, 2018. In order to solve the fuzzy transportation problem, simulated annealing SA approach and non-dominated sorting genetic algorithm NSGA-II.…

## PDF An efficient alternative approach to solve a transportation problem

May 14, 2019. PDF On Mar 8, 2019, Z. A. M. S. Juman and others published An efficient alternative approach to solve a transportation problem.…

## PDF A New approach for Solving Transportation Problem J4R.

Journal for Research Volume 03 Issue 01 March 2017 ISSN 2395-7549 A New approach for Solving Transportation Problem Manamohan Maharana.…

## Transportation and Assignment problems - Mathematics

Develop an initial solution of a transportation problem using the Northwest Corner. Rule. • use the. solve assignment problems with the Hungarian method.…

## The MODI and VAM Methods of Solving Transportation Problems

This tutorial deals with two techniques for solving transportation problems the. Select the largest negative index and proceed to solve the problem as you did.…

## A method for solving the transportation problem - Wiley Online Library

Princeton University. ABSTRACT. A new method has been developed for solving the transportation problem. This method is a modification and a generalization.…

## A method for solving the transportation problem Journal of Statistics.

Aug 6, 2018. AbstractThe transportation problem as a major problem in linear programming problems is important. To solve the transportation problem we.…