# Transportation Problem Set 8 | Transshipment Model-1

Transshipment Model is a model which comes under the transportation problem. There are two types of transshipment problem:

- With sources and destination acting as transient (i.e. intermediary) nodes
- With some transient nodes between sources and destination

Look at the given transportation problem diagram.

In a transportation problem, the shipment moves from one particular source to another particular destination, maybe from S1 to D1, S1 to D2, S1 to D3, S2 to D1, S2 to D2 and so on.

This article will discuss the Transshipment problem with sources and destination acting as transient (i.e. intermediary) nodes. The next set of this article will discuss the Transshipment problem with some transient (i.e. intermediary) nodes between sources and destination.

**Transshipment problem with sources and destination acting as transient nodes**

In this method, the shipment passes through one or more intermediary node before it reaches its desired destination. This method allows the shipment to pass from one source to another source and from one destination to another destination before it reaches the desired destination.

**Note:**The intermediary nodes can be sources and destinations themselves.

Consider the following transshipment problem involving 4 sources and 2 destinations. The supply value of the sources S1, S2, S3 and S4 are 200 units, 250 units, 300 units and 450 units respectively. The demand value for destinations D1 and D2 are 600 units and 600 units respectively. The transportation cost per unit between different sources and destinations are summarized in the following table.

Solve the transshipment problem.

Steps to solve the transshipment problem:

- Check whether it is balanced or unbalanced. Balanced, if Total sum of supply = Total sum of demand = B so the B value here is 1200.

In this case the problem is balanced see the table below. In case the problem were not balanced we could add dummy row or column to make it balance. Refer this article

- Add the value of B to all rows and columns. See the table below:

- Find out the total transportation cost using Vogel’s Approximation Method as it gives the optimized solution than Least Cost Cell Method and North West Corner Method.

After solving the transportation problem using Vogel’s Approximation Method, we get the following solution,

Just ignore the zero cost cells and calculate the transportation cost.

Total transportation cost is : (200 * 6) + (450 * 5) + (300 * 7) + (450 * 6) + (150 * 4) = 8850 - Draw the shipping pattern. Note: The allocations in the main diagonal cells are to be ignored.

To draw the shipping diagram first draw the four sources and two destinations as shown below:

- Look the table above the first allocated cell is (S1, S2). The first shipment starts from S1 to S2. The allocated value is 200.

- The second allocated cell is (S2, D1). The shipment moved from S2 to D1. The allocated value is 450.

- The next allocated cell is (S3, D2) and after that we have (S4, D2). The allocated value for these two cells are 300 and 450 respectively.

- Look the table above the first allocated cell is (S1, S2). The first shipment starts from S1 to S2. The allocated value is 200.
- The next and last allcoated cell is (D2, D1). The shipment moved from D2 to D1. The allocated value for this cell is 150.

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- The Knight's tour problem | Backtracking-1
- Josephus problem | Set 1 (A O(n) Solution)
- Tiling Problem
- Hungarian Algorithm for Assignment Problem | Set 1 (Introduction)
- Frobenius coin problem
- The Lazy Caterer's Problem
- Josephus Problem Using Bit Magic
- Maths behind number of paths in matrix problem
- Secretary Problem (A Optimal Stopping Problem)
- Number of stopping station problem
- Problem of 8 Neighbours of an element in a 2-D Matrix
- Fibonacci problem (Value of Fib(N)*Fib(N) - Fib(N-1) * Fib(N+1))
- 21 Matchsticks Problem
- Card Shuffle Problem | TCS Digital Advanced Coding Question
- Sand Timer Flip Counting Problem
- Cake Distribution Problem
- Transportation Problem | Set 1 (Introduction)
- Transportation Problem | Set 2 (NorthWest Corner Method)
- Transportation Problem | Set 3 (Least Cost Cell Method)
- Transportation Problem | Set 4 (Vogel's Approximation Method)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.