Transportation problem is a special kind of Linear Programming Problem (LPP) in which goods are transported from a set of sources to a set of destinations subject to the supply and demand of the sources and destination respectively such that the total cost of transportation is minimized. It is also sometimes called as Hitchcock problem.
Types of Transportation problems:
Balanced: When both supplies and demands are equal then the problem is said to be a balanced transportation problem.
Unbalanced: When the supply and demand are not equal then it is said to be an unbalanced transportation problem. In this type of problem, either a dummy row or a dummy column is added according to the requirement to make it a balanced problem. Then it can be solved similar to the balanced problem.
Methods to Solve:
To find the initial basic feasible solution there are three methods:
- NorthWest Corner Cell Method.
- Least Call Cell Method.
- Vogel’s Approximation Method (VAM).
Basic structure of transportation problem:
In the above table D1, D2, D3 and D4 are the destinations where the products/goods are to be delivered from different sources S1, S2, S3 and S4. Si is the supply from the source Oi. dj is the demand of the destination Dj. Cij is the cost when the product is delivered from source Si to destination Dj.
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.
- Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
- Transportation Problem | Set 5 ( Unbalanced )
- Transportation Problem Set 8 | Transshipment Model-1
- Transportation Problem | Set 4 (Vogel's Approximation Method)
- Transportation Problem | Set 2 (NorthWest Corner Method)
- Transportation Problem | Set 3 (Least Cost Cell Method)
- Transportation Problem | Set 6 (MODI Method - UV Method)
- Hungarian Algorithm for Assignment Problem | Set 1 (Introduction)
- Secretary Problem (A Optimal Stopping Problem)
- Perfect Sum Problem
- Tiling Problem
- Fibonacci problem (Value of Fib(N)*Fib(N) - Fib(N-1) * Fib(N+1))
- 21 Matchsticks Problem
- Cake Distribution Problem
- The Lazy Caterer's Problem
- Frobenius coin problem
- Josephus problem | Set 1 (A O(n) Solution)
- Josephus Problem Using Bit Magic
- 0/1 Knapsack Problem to print all possible solutions
- Problem of 8 Neighbours of an element in a 2-D Matrix
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.