Download presentation

Presentation is loading. Please wait.

1
**Introduction to Operations Research**

The Transportation Problem Initial Basic Feasible Solution Methods

2
**Transportation Problem**

Transportation model: The transportation problem deals with the distribution of goods from several points of supply (sources) to a number of points of demand (destinations) Usually we are given the capacity of goods at each source and the requirements at each destination Typically the objective is to minimize total transportation and production costs

3
**Transportation Problem**

A typical transportation problem contains Inputs: Sources with availability Destinations with requirements Unit cost of transportation from various sources to destinations Objective: To determine schedule of transportation to minimize total transportation cost

4
**Transportation Problem**

There are three basic methods to find the initial solution for a balanced Transportation Problem Northwest Corner Method Least Cost Method Vogel’s Method

5
**NorthWest corner method**

Select the northwest corner cell of the transportation table and allocate as many units as possible equal to the minimum between availability supply and demand requirements Adjust the supply and demand numbers in the respective rows and columns allocation If the supply for the first row is exhausted ,then move down to the first cell in the second row and first column and go to step 2. If the demand for the first column is satisfied, then move horizontally to the next cell in the second column and first row and go to step 2

6
**NorthWest corner method**

If for any cell, supply equals demand, then the next allocation can be made in cell either in the next row or column. Continue the procedure until the total available quantity is fully allocated to the cells as required.

7
**Northwest Corner Rule 100 200 100 100 200 Total Cost = $4,200 TO FROM**

3 SUPPLY A $5 $4 $3 100 B $8 300 C $9 $7 DEMAND 200 700 100 200 100 100 200 Total Cost = $4,200

8
Least Cost Method Although the Northwest Corner Rule is the easiest, it is not the most efficient starting point because our objective is not included in the process. The Northwest Corner Method does not utilize shipping costs. It can yield an initial bfs easily but the total shipping cost may be very high. The least cost method uses shipping costs in order come up with a bfs that has a lower cost.

9
**Least Cost Method Steps of Least Cost Method**

Select the cell with the minimum cell cost in the tableau and allocate as much to this cell as possible, but within the supply and demand constraints. Select the cell with the next minimum cell-cost and allocate as much to this cell as possible within the demand and supply constraints. Continue the procedure until all of the supply and demand requirements are satisfied. In a case of tied minimum cell-costs between two or more cells, the tie can be broken by selecting the cell that can accommodate the greater quantity.

10
**Northwest Corner Rule 100 100 200 300 Total Cost = $4,100 TO FROM 1 2**

SUPPLY A $5 $4 $3 100 B $8 300 C $9 $7 DEMAND 200 700 100 100 200 300 Total Cost = $4,100

11
**Vogel’s Approximation Method**

Vogel’s Approximation Method (VAM) is not as simple as the northwest corner method, but it provides a very good initial solution, often one that is the optimal solution VAM tackles the problem of finding a good initial solution by taking into account the costs associated with each route alternative To apply VAM, we first compute for each row and column the penalty faced if we should ship over the second-best route instead of the least-cost route

12
**Vogel’s Approximation Method**

Using Vogel’s method: Begin with computing each row and column a penalty. The penalty will be equal to the difference between the two smallest shipping costs in the row or column. Identify the row or column with the largest penalty. Find the first basic variable which has the smallest shipping cost in that row or column. Assign the highest possible value to that variable Compute new penalties and use the same procedure.

13
**Vogel’s Approximation Method**

Transportation table with VAM row and column differences shown 3 OPPORTUNITY COSTS TO FROM A B C TOTAL AVAILABLE D 100 $5 $4 $3 1 E 200 $8 300 F $9 $7 2 TOTAL REQUIRED 700

14
**Vogel’s Approximation Method**

VAM Step 2. identify the row or column with the greatest opportunity cost, or difference (column A in this example) VAM Step 3.Assign as many units as possible to the lowest-cost square in the row or column selected VAM Step 4. Eliminate any row or column that has been completely satisfied by the assignment just made by placing Xs in each appropriate square VAM Step 5. Recompute the cost differences for the transportation table, omitting rows or columns eliminated in the previous step

15
**Vogel’s Approximation Method**

VAM assignment with D’s requirements satisfied 3 1 0 3 0 2 OPPORTUNITY COSTS TO FROM A B C TOTAL AVAILABLE D 100 $5 X $4 $3 1 E $8 300 F $9 $7 2 TOTAL REQUIRED 200 700

16
**Vogel’s Approximation Method**

VAM Step 6. Return to step 2 for the rows and columns remaining and repeat the steps until an initial feasible solution has been obtained In this case column B now has the greatest difference, 3 We assign 200 units to the lowest-cost square in the column, EB We recompute the differences and find the greatest difference is now in row E We assign 100 units to the lowest-cost square in the column, EC

17
**Vogel’s Approximation Method**

Second VAM assignment with B’s requirements satisfied 3 1 0 3 0 2 OPPORTUNITY COSTS TO FROM A B C TOTAL AVAILABLE D 100 $5 X $4 $3 1 E $8 200 300 F $9 $7 2 TOTAL REQUIRED 700

18
**Vogel’s Approximation Method**

Third VAM assignment with E’s requirements satisfied TO FROM A B C TOTAL AVAILABLE D 100 $5 X $4 $3 E $8 200 300 F $9 $7 TOTAL REQUIRED 700

19
**Vogel’s Approximation Method**

Final assignments to balance column and row requirements TO FROM A B C TOTAL AVAILABLE D 100 $5 X $4 $3 E $8 200 300 F $9 $7 TOTAL REQUIRED 700 Total Cost = $3,900

Similar presentations

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google