Your SlideShare is downloading. ×
Transportation pbm
Upcoming SlideShare
Loading in...5

Thanks for flagging this SlideShare!

Oops! An error has occurred.

Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Transportation pbm


Published on

1 Like
  • Be the first to comment

No Downloads
Total Views
On Slideshare
From Embeds
Number of Embeds
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

No notes for slide


  • 1. Transportation ProblemTransportation Problem • The Transportation Model • Solution of a Transportation Problem •North west corner solution • Least cost solution
  • 2. The Transportation Model CharacteristicsThe Transportation Model Characteristics • A product is transported from a number of sources to a number of destinations at the minimum possible cost. • Each source is able to supply a fixed number of units of the product, and each destination has a fixed demand for the product. • The linear programming model has constraints for supply at each source and demand at each destination. • All constraints are equalities in a balanced transportation model where supply equals demand. • Constraints contain inequalities in unbalanced models where supply does not equal demand.
  • 3. Example of a Transportation ModelExample of a Transportation Model
  • 4. Example of a Transportation ModelExample of a Transportation Model - Problem: how many tons of wheat to transport from each grain elevator to each mill on a monthly basis in order to minimize the total cost of transportation ? - Data: Grain Elevator Supply Mill Demand 1. Kansas City 150 A. Chicago 200 2. Omaha 175 B. St.Louis 100 3. Des Moines 275 C. Cincinnati 300 Total 600 tons Total 600 tons Transport cost from Grain Elevator to Mill ($/ton) Grain Elevator A. Chicago B. St. Louis C. Cincinnati 1. Kansas City 2. Omaha 3. Des Moines $6 7 4 8 11 5 10 11 12
  • 5. 3 DCs and 3 customers.3 DCs and 3 customers. You have 3 DCs, and need to deliver product to 3 customers.You have 3 DCs, and need to deliver product to 3 customers. Find cheapest way to satisfy all demand?Find cheapest way to satisfy all demand? KC 150 O 175 DM 275 CH 200 St 100 CI 300
  • 6. Transportation Model ExampleTransportation Model Example LP Model FormulationLP Model Formulation minimize Z = 6x1A + 8x1B + 10x1C + 7x2A + 11x2B + 11x2C + 4x3A + 5x3B + 12x3C subject to x1A + x1B + x1C = 150 x2A + x2B + x2C = 175 x3A + x3B+ x3C = 275 x1A + x2A + x3A = 200 x1B + x2B + x3B = 100 x1C + x2C + x3C = 300 xij ≥ 0 Network of transportation routes for wheat shipmentswhere xij = tons of wheat from each grain elevator, i, i = 1, 2, 3, to each mill j, j = A,B,C
  • 7. Solution of the Transportation ModelSolution of the Transportation Model Tableau FormatTableau Format • Transportation problems are solved manually within a tableau format. • Each cell in a transportation tableau is analogous to a decision variable that indicates the amount allocated from a source to a destination. The Transportation Tableau
  • 8. Solution of the Transportation ModelSolution of the Transportation Model Solution MethodsSolution Methods • Transportation models do not start at the origin where all decision values are zero; they must instead be given an initial feasible solution. • Initial feasible solution determination methods include: - northwest corner method - Lowest cost method - Vogel’s Approximation Method • Methods for solving the transportation problem itself include: - Transportation Algorithm.